Tuned sorting > Thuned hash table > Baseline sorting > baselinehash table.

Note sorting wins, but it depends of the data size. Tuned sorting is more efficient for bigger data sizes than 256KiB.

The quicksort sorts spread-out data more efficiently than radix sort. Radix sort is more efficient for random data.
Using a faster hash algorithm combined with radix sort performs better than quicksort though: hash with MulSwapMul, then radix sort using diverting LSD radix sort.

Hashed radix sort is more restrictive than hash tables though. Where batching is viable, hashed radix sorts are typically viable.