Finding all of the words containing certain letters

Is there a fast method to find all of the words containing the letters: {a, e, i, o, u, y}? I created an algorithm, but it takes more than 11 seconds to find all of the words:

FindWords[{x_, y_, z_, t_, v_, n_}] :=   DictionaryLookup[___ ~~ ToString[x] ~~ ___ ~~ ToString[y] ~~ ___ ~~     ToString[z] ~~ ___ ~~ ToString[t] ~~ ___ ~~ ToString[v] ~~ ___ ~~     ToString[n] ~~ ___];Union[Flatten[   Map[FindWords, Permutations[{a, e, i, o, u, y}]]]]

Is there a faster way to do this?