Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listMar 20, 2026 21:46Pavel SkripkinPavel SkripkinScore: 200,141Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 21:46200,0431,005,110,129978,215,0001,998,0002,433,024
2Mar 20, 2026 21:46200,0881,008,424,830978,433,0001,998,0002,277,376
3Mar 20, 2026 21:46200,0951,006,732,565978,467,0001,998,0002,428,928
4Mar 20, 2026 21:46200,1251,006,665,425978,613,0001,999,0002,428,928
5Mar 20, 2026 21:46200,1411,001,906,704979,690,000999,0002,428,928
6Mar 20, 2026 21:46200,1471,004,001,744978,723,0001,999,0002,277,376
7Mar 20, 2026 21:46200,1981,001,925,804979,971,000999,0002,277,376
8Mar 20, 2026 21:46200,2831,004,844,251979,391,0001,998,0002,424,832
9Mar 20, 2026 21:46200,7811,016,682,015982,823,0001,002,0002,273,280