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 4, 2026 05:53Victor MerckléVictor MerckléScore: 25,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 05:5825,057131,229,680121,767,0001,016,0002,117,632stderr
2Sep 4, 2026 05:5825,067132,906,479121,814,0001,016,0002,117,632stderr
3Sep 4, 2026 05:5825,102132,154,189121,906,0001,094,0002,117,632stderr
4Sep 4, 2026 05:5825,107131,494,142121,927,0001,099,0002,117,632stderr
5Sep 4, 2026 05:5825,110131,496,826121,946,0001,095,0002,117,632stderr
6Sep 4, 2026 05:5825,111131,484,470121,837,0001,207,0002,117,632stderr
7Sep 4, 2026 05:5825,136133,251,560122,156,0001,013,0002,117,632stderr
8Sep 4, 2026 05:5825,163131,745,396122,292,0001,010,0002,117,632stderr
9Sep 4, 2026 05:5825,252143,518,870122,444,0001,294,0002,117,632stderr