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 10:35Victor MerckléVictor MerckléScore: 33,935Success
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 10:3533,175170,420,570161,553,0001,006,00024,576stderr
2Jul 8, 2026 10:3533,258170,855,159161,961,0001,005,0002,117,632stderr
3Jul 8, 2026 10:3533,559172,282,078161,106,0003,335,00024,576stderr
4Jul 8, 2026 10:3533,572172,396,057161,024,0003,479,0002,117,632stderr
5Jul 8, 2026 10:3533,935174,121,936162,739,0003,543,0002,117,632stderr
6Jul 8, 2026 10:3534,088174,879,976165,020,0002,012,0002,117,632stderr
7Jul 8, 2026 10:3534,477177,005,125163,266,0005,674,00024,576stderr
8Jul 8, 2026 10:3534,516176,964,511163,307,0005,823,0002,117,632stderr
9Jul 8, 2026 10:3534,602177,485,374163,403,0006,147,00024,576stderr