[tylerhou]

Works if you assign prime numbers to each letter and multiply instead. So a=2, b=3, etc.

[tuukkah]

To get decent anagram lengths and complexity, implement the numbers as a dict of repetitions of primes, and implement the multiplication by summing the repetitions. ;-)

[reinhardt]

In which case you can just compare the dicts without performing the multiplication (which happens to be the costliest part for arbitrary-precision integers).

[tuukkah]

Exactly.