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 listAug 25, 2026 12:28Victor MerckléVictor MerckléScore: 29,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:2929,561153,261,027143,822,0001,031,0002,117,632stderr
2Aug 25, 2026 12:2929,593153,394,422143,976,0001,030,0002,117,632stderr
3Aug 25, 2026 12:2929,628153,590,520144,084,0001,098,0002,117,632stderr
4Aug 25, 2026 12:2929,631153,618,298144,108,0001,088,0002,117,632stderr
5Aug 25, 2026 12:2929,635154,082,360144,078,0001,135,0002,117,632stderr
6Aug 25, 2026 12:2929,642153,631,465144,158,0001,090,0002,117,632stderr
7Aug 25, 2026 12:2929,662153,712,205144,170,0001,175,0002,117,632stderr
8Aug 25, 2026 12:2929,672153,780,777144,295,0001,099,0002,117,632stderr
9Aug 25, 2026 12:2929,679153,822,316144,340,0001,091,0002,117,632stderr