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 2, 2026 01:42Victor MerckléVictor MerckléScore: 26,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:4226,483138,202,701128,746,0001,022,0002,117,632stderr
2Sep 2, 2026 01:4226,485138,084,217128,732,0001,045,0002,117,632stderr
3Sep 2, 2026 01:4226,526138,441,896128,867,0001,112,0002,117,632stderr
4Sep 2, 2026 01:4226,538138,565,766128,935,0001,103,0002,117,632stderr
5Sep 2, 2026 01:4226,546138,475,213128,978,0001,102,0002,117,632stderr
6Sep 2, 2026 01:4226,570138,647,630129,094,0001,099,0002,117,632stderr
7Sep 2, 2026 01:4226,591138,662,417129,210,0001,087,0002,117,632stderr
8Sep 2, 2026 01:4226,610138,828,181129,278,0001,111,0002,117,632stderr
9Sep 2, 2026 01:4226,633140,124,570129,249,0001,254,0002,117,632stderr