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 08:15Victor MerckléVictor MerckléScore: 28,101Success
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 08:1528,087146,246,523136,621,0001,008,0002,117,632stderr
2Aug 25, 2026 08:1528,091146,074,450136,642,0001,008,0002,117,632stderr
3Aug 25, 2026 08:1528,094145,973,745136,656,0001,008,0002,117,632stderr
4Aug 25, 2026 08:1528,099146,110,154136,680,0001,009,0002,117,632stderr
5Aug 25, 2026 08:1528,101146,113,694136,687,0001,010,0002,117,632stderr
6Aug 25, 2026 08:1528,105146,805,013136,706,0001,010,0002,117,632stderr
7Aug 25, 2026 08:1528,106146,093,707136,715,0001,009,0002,117,632stderr
8Aug 25, 2026 08:1528,107146,128,717136,716,0001,009,0002,117,632stderr
9Aug 25, 2026 08:1528,132146,247,917136,840,0001,010,0002,117,632stderr