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:29Victor MerckléVictor MerckléScore: 25,638Success
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:3025,617134,011,195124,492,0001,036,0002,117,632stderr
2Sep 3, 2026 14:3025,628134,260,648124,550,0001,032,0002,117,632stderr
3Sep 3, 2026 14:3025,630134,574,160124,500,0001,088,0002,117,632stderr
4Sep 3, 2026 14:3025,635134,129,138124,500,0001,115,0002,117,632stderr
5Sep 3, 2026 14:3025,638134,069,337124,522,0001,106,0002,117,632stderr
6Sep 3, 2026 14:3025,639134,083,688124,531,0001,102,0002,117,632stderr
7Sep 3, 2026 14:3025,642134,672,941124,535,0001,112,0002,117,632stderr
8Sep 3, 2026 14:3025,658134,200,922124,567,0001,159,0002,117,632stderr
9Sep 3, 2026 14:3025,718143,765,389124,847,0001,172,0002,117,632stderr