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 listSep 24, 2026 15:35Andrew EpsteinAndrew EpsteinScore: 246,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:36245,9461,215,454,1881,204,135,0001,005,0002,117,632stderr
2Sep 24, 2026 15:36245,9631,215,550,6791,204,207,0001,016,0002,117,632stderr
3Sep 24, 2026 15:36246,0081,215,868,2351,204,443,0001,001,0002,117,632stderr
4Sep 24, 2026 15:36246,0441,216,008,8061,204,614,0001,005,0002,117,632stderr
5Sep 24, 2026 15:36246,0631,216,153,6171,204,699,0001,012,0002,117,632stderr
6Sep 24, 2026 15:36246,0721,216,736,9441,204,746,0001,010,0002,117,632stderr
7Sep 24, 2026 15:36246,1181,216,405,7491,204,978,0001,001,0002,117,632stderr
8Sep 24, 2026 15:36246,1331,216,728,3361,204,027,0002,025,0002,117,632stderr
9Sep 24, 2026 15:36246,2531,217,166,6461,204,635,0002,007,0002,117,632stderr