Why are you doing this? You can theoretically create a sorted list in n lg n time, or create additional hashes for every searchable substring length, but with 2^40 entries - or even a fraction of that - you won't have enough memory to hold the original hash, never mind any additional data structures.