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:38Victor MerckléVictor MerckléScore: 25,659Success
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:3925,644134,803,593124,564,0001,094,0002,117,632stderr
2Sep 3, 2026 14:3925,652134,127,133124,596,0001,102,0002,117,632stderr
3Sep 3, 2026 14:3925,656134,157,035124,616,0001,102,0002,117,632stderr
4Sep 3, 2026 14:3925,657134,182,964124,593,0001,129,0002,117,632stderr
5Sep 3, 2026 14:3925,659134,782,850124,634,0001,098,0002,117,632stderr
6Sep 3, 2026 14:3925,659134,182,236124,624,0001,107,0002,117,632stderr
7Sep 3, 2026 14:3925,662134,248,896124,654,0001,093,0002,117,632stderr
8Sep 3, 2026 14:3925,675134,250,776124,687,0001,123,0002,117,632stderr
9Sep 3, 2026 14:3925,693135,507,318124,684,0001,212,0002,117,632stderr