Some sorting problems admit a strictly faster solution than the bound for comparison sorting; an example is integer sorting, where all keys are integers.
The problem of sorting pairs of numbers by their sum is not subject to the bound either (the square resulting from the pairing up); the best known algorithm still takes time, but only comparisons.