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 18, 2026 19:28Victor MerckléVictor MerckléScore: 50,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 19:2850,767256,369,285246,722,0002,040,0002,113,536
2Jun 18, 2026 19:2850,789256,461,218246,850,0002,019,0002,113,536
3Jun 18, 2026 19:2850,812256,590,357246,951,0002,031,0002,113,536
4Jun 18, 2026 19:2850,815256,570,974246,966,0002,031,0002,113,536
5Jun 18, 2026 19:2850,832256,763,028247,049,0002,029,0002,113,536
6Jun 18, 2026 19:2850,855256,587,047247,162,0002,030,0002,113,536
7Jun 18, 2026 19:2850,881256,916,648247,312,0002,007,0002,113,536
8Jun 18, 2026 19:2850,915257,148,071247,462,0002,025,0002,113,536
9Jun 18, 2026 19:2850,934257,187,545247,483,0002,097,0002,113,536