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 14:22Victor MerckléVictor MerckléScore: 25,814Success
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 14:2225,778134,729,864125,274,0001,039,0002,117,632stderr
2Sep 2, 2026 14:2225,783134,784,630125,312,0001,027,0002,117,632stderr
3Sep 2, 2026 14:2225,807134,902,272125,361,0001,098,0002,117,632stderr
4Sep 2, 2026 14:2225,813134,923,952125,381,0001,105,0002,117,632stderr
5Sep 2, 2026 14:2225,814134,881,548125,405,0001,084,0002,117,632stderr
6Sep 2, 2026 14:2225,817134,933,707125,421,0001,087,0002,117,632stderr
7Sep 2, 2026 14:2225,818134,945,723125,419,0001,090,0002,117,632stderr
8Sep 2, 2026 14:2225,824134,929,028125,445,0001,094,0002,117,632stderr
9Sep 2, 2026 14:2225,836136,665,434125,422,0001,177,0002,117,632stderr