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 listJul 7, 2026 17:12Victor MerckléVictor MerckléScore: 39,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:1338,337195,883,582180,906,0006,948,00024,576stderr
2Jul 7, 2026 17:1338,796197,924,355182,451,0007,652,0002,117,632stderr
3Jul 7, 2026 17:1338,838198,450,964182,426,0007,881,0002,117,632stderr
4Jul 7, 2026 17:1338,905198,678,933182,333,0008,303,00024,576stderr
5Jul 7, 2026 17:1339,074199,520,077182,276,0009,187,00024,576stderr
6Jul 7, 2026 17:1339,081199,551,138182,738,0008,761,0002,117,632stderr
7Jul 7, 2026 17:1339,129199,702,184184,482,0007,251,0002,117,632stderr
8Jul 7, 2026 17:1339,341200,867,582183,288,0009,486,00024,576stderr
9Jul 7, 2026 17:1339,624202,247,908185,358,0008,802,00024,576stderr