Public domain Quicksort has surrendered speed to protect against typical "weird" inputs that lead to quadratic, worst case behavior.
Sixsort beats the current workhorse QSORT (Bentley & McIlroy, 1993) on the Bentley bench test and shows that Sixsort is well protected against quadratic explosions (QSORT does have quadratic explosions).
Sixsort is robust. Speed variance on a 126 member set of distributions on a 1M array: 12%; QSORT: 75%.
Sixsort is 20-40% faster than QSORT and is way faster than the best Quicksort that we could develop (the blue line is on a Linux box, the two others emulate Unix on XP/Cygwin):