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 09:58Victor MerckléVictor MerckléScore: 36,748Success
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 10:0535,869183,785,520166,200,0009,561,0002,117,632stderr
2Jul 7, 2026 10:0536,330186,006,872167,227,00010,791,0002,117,632stderr
3Jul 7, 2026 10:0536,671187,737,938170,083,0009,606,0002,117,632stderr
4Jul 7, 2026 10:0536,693187,768,878168,493,00011,304,0002,117,632stderr
5Jul 7, 2026 10:0536,748188,043,996166,846,00013,223,0002,117,632stderr
6Jul 7, 2026 10:0536,797188,426,566167,478,00012,828,0002,117,632stderr
7Jul 7, 2026 10:0536,798188,243,007168,119,00012,193,0002,117,632stderr
8Jul 7, 2026 10:0536,889188,772,908166,954,00013,806,0002,117,632stderr
9Jul 7, 2026 10:0536,921188,946,812167,940,00012,976,0002,117,632stderr