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 6, 2026 18:59Victor MerckléVictor MerckléScore: 57,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 18:5956,832287,602,206276,274,0002,203,0002,113,536
2Jun 6, 2026 18:5956,890287,876,145276,560,0002,203,0002,113,536
3Jun 6, 2026 18:5957,037288,670,903277,230,0002,253,0002,113,536
4Jun 6, 2026 18:5957,343290,533,009278,758,0002,227,0002,113,536
5Jun 6, 2026 18:5957,634291,581,530280,387,0002,020,0002,113,536
6Jun 6, 2026 18:5957,720292,326,873280,629,0002,200,0002,113,536
7Jun 6, 2026 18:5957,747292,117,125280,938,0002,023,0002,113,536
8Jun 6, 2026 18:5957,791292,371,543280,985,0002,193,0002,113,536
9Jun 6, 2026 18:5957,816292,479,838281,226,0002,077,0002,113,536