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 listMay 11, 2026 18:16Victor MerckléVictor MerckléScore: 65,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:1765,197328,971,717317,399,0002,069,0002,113,536
2May 11, 2026 18:1765,309328,780,841317,932,0002,086,0002,113,536
3May 11, 2026 18:1765,373331,738,129318,251,0002,078,0002,113,536
4May 11, 2026 18:1765,394329,349,965318,243,0002,190,0002,113,536
5May 11, 2026 18:1765,413331,263,719318,292,0002,233,0002,113,536
6May 11, 2026 18:1765,516332,752,286318,853,0002,180,0002,113,536
7May 11, 2026 18:1765,635330,400,350319,512,0002,103,0002,113,536
8May 11, 2026 18:1765,687332,655,950319,691,0002,178,0002,113,536
9May 11, 2026 18:1766,147333,584,379322,042,0002,081,0002,113,536