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 16:19Victor MerckléVictor MerckléScore: 33,272Success
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 16:2033,100170,042,691161,187,0001,005,0002,117,632stderr
2Jul 7, 2026 16:2033,128170,212,404161,326,0001,005,0002,117,632stderr
3Jul 7, 2026 16:2033,161170,391,416161,485,0001,007,0002,117,632stderr
4Jul 7, 2026 16:2033,246170,823,581161,904,0001,006,0002,117,632stderr
5Jul 7, 2026 16:2033,272170,875,477162,032,0001,005,0002,117,632stderr
6Jul 7, 2026 16:2033,416171,600,533162,737,0001,005,0002,117,632stderr
7Jul 7, 2026 16:2033,563172,290,770163,456,0001,007,0002,117,632stderr
8Jul 7, 2026 16:2033,599172,705,625163,632,0001,006,0002,117,632stderr
9Jul 7, 2026 16:2033,813173,541,564164,678,0001,006,0002,117,632stderr