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 7, 2026 15:46Victor MerckléVictor MerckléScore: 42,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 15:4739,002199,281,490190,103,0001,007,0002,117,632stderr
2Jul 7, 2026 15:4739,008199,090,517189,096,0002,044,0002,117,632stderr
3Jul 7, 2026 15:4739,098199,413,561190,574,0001,008,0002,117,632stderr
4Jul 7, 2026 15:4741,800212,621,130193,911,00010,912,00024,576stderr
5Jul 7, 2026 15:4742,100214,119,624192,781,00013,510,00024,576stderr
6Jul 7, 2026 15:4742,461215,840,069195,692,00012,371,0002,117,632stderr
7Jul 7, 2026 15:4743,468221,067,304196,460,00016,534,00024,576stderr
8Jul 7, 2026 15:4743,588221,661,281197,307,00016,275,00024,576stderr
9Jul 7, 2026 15:4744,112223,999,652197,494,00018,659,0002,117,632stderr