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 13:11Victor MerckléVictor MerckléScore: 25,631Success
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 13:1225,613133,950,050124,484,0001,021,0002,117,632stderr
2Sep 3, 2026 13:1225,623135,565,340124,519,0001,034,0002,117,632stderr
3Sep 3, 2026 13:1225,630134,149,530124,490,0001,100,0002,117,632stderr
4Sep 3, 2026 13:1225,631134,073,854124,495,0001,100,0002,117,632stderr
5Sep 3, 2026 13:1225,631134,043,195124,499,0001,093,0002,117,632stderr
6Sep 3, 2026 13:1225,633134,017,931124,511,0001,094,0002,117,632stderr
7Sep 3, 2026 13:1225,635133,997,733124,528,0001,087,0002,117,632stderr
8Sep 3, 2026 13:1225,642136,134,660124,519,0001,129,0002,117,632stderr
9Sep 3, 2026 13:1225,648134,109,078124,582,0001,097,0002,117,632stderr