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 16:32Victor MerckléVictor MerckléScore: 25,607Success
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 16:3225,593133,891,313124,139,0001,270,0002,117,632stderr
2Sep 3, 2026 16:3225,603133,884,490124,418,0001,038,0002,117,632stderr
3Sep 3, 2026 16:3225,605134,054,698124,450,0001,016,0002,117,632stderr
4Sep 3, 2026 16:3225,607133,926,170124,465,0001,014,0002,117,632stderr
5Sep 3, 2026 16:3225,607133,919,137124,460,0001,019,0002,117,632stderr
6Sep 3, 2026 16:3225,610135,138,238124,462,0001,028,0002,117,632stderr
7Sep 3, 2026 16:3225,612134,023,497124,475,0001,024,0002,117,632stderr
8Sep 3, 2026 16:3225,617134,073,703124,382,0001,143,0002,117,632stderr
9Sep 3, 2026 16:3225,618134,024,715124,490,0001,040,0002,117,632stderr