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 5, 2026 19:10Victor MerckléVictor MerckléScore: 38,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:1138,547198,619,933186,852,0002,033,00024,576stderr
2Jul 5, 2026 19:1138,562196,983,504186,948,0002,010,00024,576stderr
3Jul 5, 2026 19:1138,718197,751,516186,715,0003,007,00024,576stderr
4Jul 5, 2026 19:1138,741199,220,209187,822,0002,009,00024,576stderr
5Jul 5, 2026 19:1138,972198,758,473187,737,0003,226,00024,576stderr
6Jul 5, 2026 19:1139,179199,826,895188,941,0003,040,00024,576stderr
7Jul 5, 2026 19:1139,687202,435,550188,502,0005,969,00024,576stderr
8Jul 5, 2026 19:1139,734202,753,061188,325,0006,376,00024,576stderr
9Jul 5, 2026 19:1140,194204,982,368191,041,0005,911,00024,576stderr