代码

unsigned long long A[1<<26];
void sort(unsigned *a, int n) {
	for (int i=0; i<n; ++i) A[*a>>6] |= 1ull << (*a & 63);
	for (int i=0; i<1<<26; ++i) {
		unsigned long long t = A[i];
		while (t) {
			*a++ = i * 64u + __builtin_ctzll(t); t &= t-1; }}
}

评测结果