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 02:48Victor MerckléVictor MerckléScore: 28,462Success
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 02:5028,434147,778,814138,238,0001,091,0002,117,632stderr
2Sep 2, 2026 02:5028,438147,796,194138,306,0001,045,0002,117,632stderr
3Sep 2, 2026 02:5028,443147,749,252138,286,0001,088,0002,117,632stderr
4Sep 2, 2026 02:5028,450147,569,577138,302,0001,105,0002,117,632stderr
5Sep 2, 2026 02:5028,462147,892,730138,379,0001,085,0002,117,632stderr
6Sep 2, 2026 02:5028,473147,896,683138,418,0001,100,0002,117,632stderr
7Sep 2, 2026 02:5028,477147,925,014138,440,0001,101,0002,117,632stderr
8Sep 2, 2026 02:5028,479148,642,444138,448,0001,100,0002,117,632stderr
9Sep 2, 2026 02:5028,526148,839,368138,505,0001,277,0002,117,632stderr