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 listMay 11, 2026 12:00Victor MerckléVictor MerckléScore: 101,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 12:00101,191507,145,955493,811,0002,029,0002,113,536
2May 11, 2026 12:00101,199504,550,807493,861,0002,015,0002,113,536
3May 11, 2026 12:00101,263507,014,676494,153,0002,040,0002,113,536
4May 11, 2026 12:00101,419507,670,961494,904,0002,053,0002,113,536
5May 11, 2026 12:00101,424506,860,229494,937,0002,041,0002,113,536
6May 11, 2026 12:00101,426506,179,638494,913,0002,076,0002,113,536
7May 11, 2026 12:00101,510508,531,642495,197,0002,205,0002,113,536
8May 11, 2026 12:00101,519509,334,431495,389,0002,055,0002,113,536
9May 11, 2026 12:00101,565508,394,244495,642,0002,031,0002,113,536