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 05:13Victor MerckléVictor MerckléScore: 30,995Success
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 05:1330,946160,149,408149,630,0002,010,0002,117,632stderr
2Aug 25, 2026 05:1330,964160,137,678150,715,0001,009,0002,117,632stderr
3Aug 25, 2026 05:1330,974160,252,357149,760,0002,014,0002,117,632stderr
4Aug 25, 2026 05:1330,990161,323,169150,842,0001,010,0002,117,632stderr
5Aug 25, 2026 05:1330,995160,335,902150,871,0001,009,0002,117,632stderr
6Aug 25, 2026 05:1330,999160,416,385150,889,0001,008,0002,117,632stderr
7Aug 25, 2026 05:1331,034160,461,098151,059,0001,010,0002,117,632stderr
8Aug 25, 2026 05:1331,036160,620,128151,068,0001,010,0002,117,632stderr
9Aug 25, 2026 05:1331,039160,633,157151,087,0001,008,0002,117,632stderr