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 2, 2026 01:48Victor MerckléVictor MerckléScore: 26,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:4826,638138,937,426129,521,0001,009,0002,117,632stderr
2Sep 2, 2026 01:4826,641139,001,371129,525,0001,019,0002,117,632stderr
3Sep 2, 2026 01:4826,651139,119,113129,569,0001,024,0002,117,632stderr
4Sep 2, 2026 01:4826,710139,445,217129,780,0001,102,0002,117,632stderr
5Sep 2, 2026 01:4826,718139,250,840129,826,0001,096,0002,117,632stderr
6Sep 2, 2026 01:4826,733139,490,504129,875,0001,117,0002,117,632stderr
7Sep 2, 2026 01:4826,742140,126,345129,936,0001,102,0002,117,632stderr
8Sep 2, 2026 01:4826,746139,497,202129,967,0001,091,0002,117,632stderr
9Sep 2, 2026 01:4826,757139,610,799129,986,0001,124,0002,117,632stderr