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 5, 2026 18:30Victor MerckléVictor MerckléScore: 41,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:3140,915208,355,031199,482,0001,006,0002,117,632stderr
2Jul 5, 2026 18:3141,090209,578,466200,337,0001,008,0002,117,632stderr
3Jul 5, 2026 18:3141,180209,586,000200,776,0001,007,0002,117,632stderr
4Jul 5, 2026 18:3141,202209,733,306200,885,0001,006,0002,117,632stderr
5Jul 5, 2026 18:3141,255209,960,976200,076,0002,077,0002,117,632stderr
6Jul 5, 2026 18:3141,323210,394,547200,455,0002,028,0002,117,632stderr
7Jul 5, 2026 18:3141,344210,508,296201,584,0001,006,0002,117,632stderr
8Jul 5, 2026 18:3141,345210,368,627201,585,0001,006,0002,117,632stderr
9Jul 5, 2026 18:3141,638211,853,792203,023,0001,007,0002,117,632stderr