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 3, 2026 17:51Victor MerckléVictor MerckléScore: 25,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:5125,582134,496,910124,329,0001,025,0002,117,632stderr
2Sep 3, 2026 17:5125,582133,845,108124,315,0001,039,0002,117,632stderr
3Sep 3, 2026 17:5125,601133,967,271124,348,0001,097,0002,117,632stderr
4Sep 3, 2026 17:5125,603133,926,834124,361,0001,095,0002,117,632stderr
5Sep 3, 2026 17:5125,603133,877,327124,371,0001,088,0002,117,632stderr
6Sep 3, 2026 17:5125,632134,034,263124,505,0001,092,0002,117,632stderr
7Sep 3, 2026 17:5125,634134,040,470124,405,0001,202,0002,117,632stderr
8Sep 3, 2026 17:5125,682134,042,780124,742,0001,103,0002,117,632stderr
9Sep 3, 2026 17:5125,694134,397,315124,894,0001,010,0002,117,632stderr