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 listAug 24, 2026 20:26Victor MerckléVictor MerckléScore: 35,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:2735,249181,203,300171,717,0001,005,0002,117,632stderr
2Aug 24, 2026 20:2735,255181,185,299171,748,0001,005,0002,117,632stderr
3Aug 24, 2026 20:2735,358181,641,009172,250,0001,008,0002,117,632stderr
4Aug 24, 2026 20:2735,577183,137,535173,325,0001,006,0002,117,632stderr
5Aug 24, 2026 20:2735,629183,002,022173,579,0001,007,0002,117,632stderr
6Aug 24, 2026 20:2735,641182,966,440172,638,0002,005,0002,117,632stderr
7Aug 24, 2026 20:2735,648191,538,332172,566,0002,110,0002,117,632stderr
8Aug 24, 2026 20:2735,826190,921,198174,545,0001,007,0002,117,632stderr
9Aug 24, 2026 20:2736,020194,535,990174,391,0002,109,0002,117,632stderr