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 listSep 3, 2026 16:25Victor MerckléVictor MerckléScore: 26,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 16:2626,550138,517,934129,073,0001,025,0002,117,632stderr
2Sep 3, 2026 16:2626,563138,622,640129,071,0001,091,0002,117,632stderr
3Sep 3, 2026 16:2626,569138,631,756129,083,0001,108,0002,117,632stderr
4Sep 3, 2026 16:2626,572138,738,424129,105,0001,098,0002,117,632stderr
5Sep 3, 2026 16:2626,572138,641,540129,106,0001,098,0002,117,632stderr
6Sep 3, 2026 16:2626,574138,657,421129,103,0001,111,0002,117,632stderr
7Sep 3, 2026 16:2626,576139,251,670129,122,0001,103,0002,117,632stderr
8Sep 3, 2026 16:2626,580138,676,289129,106,0001,137,0002,117,632stderr
9Sep 3, 2026 16:2626,581138,791,532129,147,0001,101,0002,117,632stderr