Hashed sorting is typically faster than hash tables

Getting peak performance on a specific problem takes a lot of tuning! I benchmarked ~10 implementations on ~20 configurations, including 3 new implementations I wrote, one of which beats any other implementation I tested by a large margin.

I also propose hashed sorting as an potentially useful hybrid.