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 listJul 4, 2026 13:33Victor MerckléVictor MerckléScore: 46,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 13:3346,910237,850,521227,836,0002,024,0002,117,632stderr
2Jul 4, 2026 13:3346,912237,875,019227,719,0002,154,0002,117,632stderr
3Jul 4, 2026 13:3346,933239,348,402227,961,0002,014,0002,117,632stderr
4Jul 4, 2026 13:3346,945238,064,256227,916,0002,116,0002,117,632stderr
5Jul 4, 2026 13:3346,956238,159,154227,892,0002,197,0002,117,632stderr
6Jul 4, 2026 13:3346,983238,217,884228,160,0002,061,0002,117,632stderr
7Jul 4, 2026 13:3346,998238,266,315228,281,0002,011,0002,117,632stderr
8Jul 4, 2026 13:3346,998238,605,894228,282,0002,012,0002,117,632stderr
9Jul 4, 2026 13:3347,141239,019,577228,803,0002,188,0002,117,632stderr