The radix sort implementation is not optimal. Instead of sorting 1 digit at a time, it should be sorting 11 digits at a time to saturate the cache lines.
So the baseline radix sort can be even faster.
So the baseline radix sort can be even faster.
The radix sort was used to provide an estimate for how much better the quicksort could improve.