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 3, 2026 16:43Victor MerckléVictor MerckléScore: 49,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 16:4649,534250,912,361240,715,0002,006,0002,117,632stderr
2Jul 3, 2026 16:4649,549250,526,304240,751,0002,042,0002,117,632stderr
3Jul 3, 2026 16:4649,561250,787,465240,829,0002,022,0002,117,632stderr
4Jul 3, 2026 16:4649,562250,900,930241,850,0001,006,0002,117,632stderr
5Jul 3, 2026 16:4649,564250,665,194240,828,0002,039,0002,117,632stderr
6Jul 3, 2026 16:4649,655251,243,020242,302,0001,008,0002,117,632stderr
7Jul 3, 2026 16:4649,675251,183,269241,396,0002,015,0002,117,632stderr
8Jul 3, 2026 16:4649,676251,350,490241,354,0002,062,0002,117,632stderr
9Jul 3, 2026 16:4649,902252,438,694242,494,0002,029,0002,117,632stderr