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 05:13Victor MerckléVictor MerckléScore: 26,641Success
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 05:1526,628138,919,929129,464,0001,016,0002,117,632stderr
2Sep 2, 2026 05:1526,633138,930,201129,420,0001,085,0002,117,632stderr
3Sep 2, 2026 05:1526,634139,557,503129,412,0001,099,0002,117,632stderr
4Sep 2, 2026 05:1526,640138,939,833129,436,0001,101,0002,117,632stderr
5Sep 2, 2026 05:1526,641139,446,303129,426,0001,118,0002,117,632stderr
6Sep 2, 2026 05:1526,641139,044,624129,451,0001,094,0002,117,632stderr
7Sep 2, 2026 05:1526,642139,473,391129,442,0001,107,0002,117,632stderr
8Sep 2, 2026 05:1526,647139,074,608129,450,0001,121,0002,117,632stderr
9Sep 2, 2026 05:1526,663139,136,790129,540,0001,112,0002,117,632stderr