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 listJul 4, 2026 15:41Victor MerckléVictor MerckléScore: 55,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:4255,146278,136,159269,217,0001,003,0002,117,632stderr
2Jul 4, 2026 15:4255,193278,352,303268,419,0002,028,0002,117,632stderr
3Jul 4, 2026 15:4255,226278,991,026268,589,0002,020,0002,117,632stderr
4Jul 4, 2026 15:4255,247278,726,510268,587,0002,127,0002,117,632stderr
5Jul 4, 2026 15:4255,260278,700,421268,631,0002,147,0002,117,632stderr
6Jul 4, 2026 15:4255,272278,882,244268,721,0002,115,0002,117,632stderr
7Jul 4, 2026 15:4255,314279,033,677269,034,0002,008,0002,117,632stderr
8Jul 4, 2026 15:4255,328279,076,358269,029,0002,082,0002,117,632stderr
9Jul 4, 2026 15:4255,360279,569,306269,261,0002,007,0002,117,632stderr