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 2, 2026 14:26Victor MerckléVictor MerckléScore: 28,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 14:2828,444147,768,984138,290,0001,089,0002,117,632stderr
2Sep 2, 2026 14:2828,445147,789,904138,282,0001,100,0002,117,632stderr
3Sep 2, 2026 14:2828,453147,887,239138,298,0001,122,0002,117,632stderr
4Sep 2, 2026 14:2828,470148,146,883138,393,0001,114,0002,117,632stderr
5Sep 2, 2026 14:2828,474147,970,065138,412,0001,111,0002,117,632stderr
6Sep 2, 2026 14:2828,476147,962,304138,443,0001,093,0002,117,632stderr
7Sep 2, 2026 14:2828,541148,235,137138,754,0001,098,0002,117,632stderr
8Sep 2, 2026 14:2828,544148,974,083138,766,0001,104,0002,117,632stderr
9Sep 2, 2026 14:2828,571148,422,504138,782,0001,220,0002,117,632stderr