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 18:45Victor MerckléVictor MerckléScore: 39,163Success
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 18:4638,734197,848,700186,781,0003,020,00024,576stderr
2Jul 5, 2026 18:4638,942198,812,191188,804,0002,013,00024,576stderr
3Jul 5, 2026 18:4638,983198,972,203189,007,0002,013,00024,576stderr
4Jul 5, 2026 18:4638,984198,890,157187,655,0003,369,0002,117,632stderr
5Jul 5, 2026 18:4639,163199,946,099188,691,0003,208,00024,576stderr
6Jul 5, 2026 18:4639,246200,088,285190,296,0002,014,00024,576stderr
7Jul 5, 2026 18:4639,365200,972,215187,904,0004,985,00024,576stderr
8Jul 5, 2026 18:4639,736202,495,553189,617,0005,093,00024,576stderr
9Jul 5, 2026 18:4639,788202,936,701189,843,0005,119,00024,576stderr