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 8, 2026 02:26Victor MerckléVictor MerckléScore: 32,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 02:2631,972164,819,227154,627,0002,038,00024,576stderr
2Jul 8, 2026 02:2632,081165,201,826154,641,0002,557,00024,576stderr
3Jul 8, 2026 02:2632,089165,342,479155,043,0002,194,00024,576stderr
4Jul 8, 2026 02:2632,131165,387,283155,417,0002,028,00024,576stderr
5Jul 8, 2026 02:2632,162165,688,530154,289,0003,309,0002,117,632stderr
6Jul 8, 2026 02:2632,191165,760,577154,396,0003,342,0002,117,632stderr
7Jul 8, 2026 02:2632,194165,847,904155,728,0002,025,00024,576stderr
8Jul 8, 2026 02:2632,428167,035,621155,257,0003,644,0002,117,632stderr
9Jul 8, 2026 02:2632,611168,001,656157,778,0002,019,00024,576stderr