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 4, 2026 07:43Victor MerckléVictor MerckléScore: 25,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:5225,549133,622,218124,102,0001,091,0002,117,632stderr
2Sep 4, 2026 07:5225,552133,627,335124,097,0001,111,0002,117,632stderr
3Sep 4, 2026 07:5225,554133,633,660124,127,0001,089,0002,117,632stderr
4Sep 4, 2026 07:5225,555133,676,530124,123,0001,099,0002,117,632stderr
5Sep 4, 2026 07:5225,561133,975,132124,150,0001,101,0002,117,632stderr
6Sep 4, 2026 07:5225,565134,411,466124,145,0001,125,0002,117,632stderr
7Sep 4, 2026 07:5225,567133,796,142124,161,0001,118,0002,117,632stderr
8Sep 4, 2026 07:5225,571133,682,652124,081,0001,219,0002,117,632stderr
9Sep 4, 2026 07:5225,634135,252,399124,601,0001,007,0002,117,632stderr