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 listSep 3, 2026 14:31Victor MerckléVictor MerckléScore: 26,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 14:3226,235136,991,014127,530,0001,025,0002,117,632stderr
2Sep 3, 2026 14:3226,244137,033,087127,498,0001,098,0002,117,632stderr
3Sep 3, 2026 14:3226,252137,228,133127,540,0001,098,0002,117,632stderr
4Sep 3, 2026 14:3226,253137,143,497127,511,0001,130,0002,117,632stderr
5Sep 3, 2026 14:3226,254137,785,738127,553,0001,095,0002,117,632stderr
6Sep 3, 2026 14:3226,258137,082,014127,575,0001,090,0002,117,632stderr
7Sep 3, 2026 14:3226,258137,206,690127,564,0001,103,0002,117,632stderr
8Sep 3, 2026 14:3226,268137,142,805127,550,0001,165,0002,117,632stderr
9Sep 3, 2026 14:3226,310137,486,672127,910,0001,013,0002,117,632stderr