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 12, 2026 03:11Victor MerckléVictor MerckléScore: 59,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 03:1158,342294,934,608283,670,0002,206,0002,113,536
2Jun 12, 2026 03:1158,352295,038,605283,754,0002,173,0002,113,536
3Jun 12, 2026 03:1158,791297,182,809285,970,0002,109,0002,113,536
4Jun 12, 2026 03:1158,944298,540,023286,604,0002,224,0002,113,536
5Jun 12, 2026 03:1159,035298,477,253287,002,0002,271,0002,113,536
6Jun 12, 2026 03:1159,141299,298,549287,565,0002,226,0002,113,536
7Jun 12, 2026 03:1159,653301,399,367290,105,0002,199,0002,113,536
8Jun 12, 2026 03:1159,656301,405,523290,129,0002,190,0002,113,536
9Jun 12, 2026 03:1162,773316,732,336305,388,0002,203,0002,113,536