The big hash takes very little time to load from a pre-generated file of the 10! permutations--it doesn't actually take that long to generate either--and the 350 MB loads easily within my 512 MB ram machine without swapping (if I haven't got much else running at the time).
If raw performance is the criteria, it is by far the quickest and simplest option.
Of course, if the criteria changed to be 11 digits, it starts to becomes impractical, but that's tomorrows problem :)
In reply to Re^4: Determining uniqueness in a string.
by BrowserUk
in thread Determining uniqueness in a string.
by Yzzyx
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |