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 listJul 4, 2026 21:52Victor MerckléVictor MerckléScore: 47,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 21:5247,283239,760,770229,584,0002,106,0002,117,632stderr
2Jul 4, 2026 21:5247,445240,510,311230,406,0002,076,0002,117,632stderr
3Jul 4, 2026 21:5247,450240,460,970230,420,0002,089,0002,117,632stderr
4Jul 4, 2026 21:5247,469240,411,104230,551,0002,050,0002,117,632stderr
5Jul 4, 2026 21:5247,484240,622,727230,645,0002,030,0002,117,632stderr
6Jul 4, 2026 21:5247,554240,851,056230,985,0002,033,0002,117,632stderr
7Jul 4, 2026 21:5247,578240,907,972231,099,0002,036,0002,117,632stderr
8Jul 4, 2026 21:5247,677242,241,692231,562,0002,060,0002,117,632stderr
9Jul 4, 2026 21:5247,924242,629,038232,808,0002,020,0002,117,632stderr