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 listAug 25, 2026 10:21Victor MerckléVictor MerckléScore: 27,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 10:2227,608143,728,357134,178,0001,106,0002,117,632stderr
2Aug 25, 2026 10:2227,612143,712,488134,189,0001,110,0002,117,632stderr
3Aug 25, 2026 10:2227,624143,974,869134,266,0001,096,0002,117,632stderr
4Aug 25, 2026 10:2227,626144,450,830134,235,0001,136,0002,117,632stderr
5Aug 25, 2026 10:2227,634143,811,627134,309,0001,102,0002,117,632stderr
6Aug 25, 2026 10:2227,638143,884,150134,334,0001,093,0002,117,632stderr
7Aug 25, 2026 10:2227,650143,943,042134,385,0001,100,0002,117,632stderr
8Aug 25, 2026 10:2227,652143,872,884134,402,0001,095,0002,117,632stderr
9Aug 25, 2026 10:2227,661143,917,203134,448,0001,093,0002,117,632stderr