"Faster sorting"?

Heap sort achieves the Gleason bound and, thus, is the fastest possible sort by comparing pairs of keys.

For keys not too long, radix sort can be faster.

These facts have been very well known for decades.

There might be more to do in sorting with some different records, keys, computer architecture, concerns about caches and locality of reference, but otherwise, thankfully, sorting is a well solved problem.