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 listJun 22, 2026 06:08Victor MerckléVictor MerckléScore: 51,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 06:0951,717261,492,243251,363,0002,055,0002,113,536
2Jun 22, 2026 06:0951,741261,591,879251,484,0002,051,0002,113,536
3Jun 22, 2026 06:0951,787263,082,409251,634,0002,126,0002,113,536
4Jun 22, 2026 06:0951,790261,508,548251,716,0002,059,0002,113,536
5Jun 22, 2026 06:0951,795261,385,632251,629,0002,168,0002,113,536
6Jun 22, 2026 06:0951,811261,572,981251,838,0002,038,0002,113,536
7Jun 22, 2026 06:0951,820261,595,463251,878,0002,041,0002,113,536
8Jun 22, 2026 06:0951,839261,734,294251,877,0002,137,0002,113,536
9Jun 22, 2026 06:0952,411264,574,812254,780,0002,038,0002,113,536