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 listJun 5, 2026 22:28Victor MerckléVictor MerckléScore: 57,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 22:2857,878292,766,225281,599,0002,007,0002,113,536
2Jun 5, 2026 22:2857,888292,931,239281,639,0002,013,0002,113,536
3Jun 5, 2026 22:2857,901292,850,666281,512,0002,203,0002,113,536
4Jun 5, 2026 22:2857,910292,966,470281,721,0002,041,0002,113,536
5Jun 5, 2026 22:2857,912293,036,854281,516,0002,254,0002,113,536
6Jun 5, 2026 22:2857,950294,334,607281,714,0002,242,0002,113,536
7Jun 5, 2026 22:2857,953293,150,967281,761,0002,213,0002,113,536
8Jun 5, 2026 22:2857,957293,177,394281,925,0002,067,0002,113,536
9Jun 5, 2026 22:2857,983293,317,293281,888,0002,232,0002,113,536