Which non-comparison-based sorting algorithm treats elements as sequences of digits to achieve linear-time performance?

Radix sort

Radix sort processes digits from least significant to most significant using a stable sort (usually Counting Sort) as a subroutine. If the number of digits is constant, the algorithm runs in O(n) time.