代码

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

评测结果