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 30, 2026 14:06Victor MerckléVictor MerckléScore: 55,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:0754,988277,348,629267,392,0002,051,0002,117,632stderr
2Jun 30, 2026 14:0754,990277,551,710267,391,0002,060,0002,117,632stderr
3Jun 30, 2026 14:0755,021277,842,652267,586,0002,019,0002,117,632stderr
4Jun 30, 2026 14:0755,045277,615,268267,693,0002,031,0002,117,632stderr
5Jun 30, 2026 14:0755,049277,615,219267,685,0002,059,0002,117,632stderr
6Jun 30, 2026 14:0755,057277,560,406267,647,0002,137,0002,117,632stderr
7Jun 30, 2026 14:0755,058277,418,963267,709,0002,076,0002,117,632stderr
8Jun 30, 2026 14:0755,083277,824,209267,837,0002,072,0002,117,632stderr
9Jun 30, 2026 14:0755,113277,688,338267,945,0002,112,0002,117,632stderr