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 12:18Victor MerckléVictor MerckléScore: 25,654Success
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 12:2225,642134,114,879124,561,0001,089,0002,117,632stderr
2Sep 3, 2026 12:2225,643134,084,251124,556,0001,097,0002,117,632stderr
3Sep 3, 2026 12:2225,649135,501,767124,572,0001,111,0002,117,632stderr
4Sep 3, 2026 12:2225,650134,121,279124,584,0001,103,0002,117,632stderr
5Sep 3, 2026 12:2225,654134,111,594124,612,0001,095,0002,117,632stderr
6Sep 3, 2026 12:2225,663134,294,754124,620,0001,133,0002,117,632stderr
7Sep 3, 2026 12:2225,744142,817,620124,990,0001,158,0002,117,632stderr
8Sep 3, 2026 12:2225,761144,685,170125,074,0001,159,0002,117,632stderr
9Sep 3, 2026 12:2225,794144,686,676125,198,0001,196,0002,117,632stderr