代码

#include <stdlib.h>
#include <string.h>
static unsigned fill[256];
void sort(unsigned *a, int n) {
    unsigned stride = (unsigned)((n >> 8) + (n >> 9) + 8192);
    unsigned *tmp = (unsigned *)malloc((size_t)stride * 256u * 4u);
    if (!tmp) return;
    memset(fill, 0, sizeof(fill));
    for (int i = 0; i < n; i++) {
        unsigned v = a[i]; unsigned b = v >> 24;
        tmp[(size_t)b * stride + fill[b]] = v; fill[b]++;
    }
}

评测结果