Input is n integers, but we know that they cannot exceed 10 digits, i.e. the largest number is 10^10

How can we take advantage of this to beat O(n log n)? Obviously sheer bucket sort is out of the question with such large numbers, what else can I do to avoid doing a comparison sort such that I can beat O(n log n)?