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 listAug 24, 2026 19:42Victor MerckléVictor MerckléScore: 31,944Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:4231,710164,544,759154,371,0001,011,0002,117,632stderr
2Aug 24, 2026 19:4231,718163,755,186154,412,0001,011,0002,117,632stderr
3Aug 24, 2026 19:4231,764164,196,436154,638,0001,010,0002,117,632stderr
4Aug 24, 2026 19:4231,872164,535,179155,164,0001,009,0002,117,632stderr
5Aug 24, 2026 19:4231,944165,586,001155,517,0001,010,0002,117,632stderr
6Aug 24, 2026 19:4232,035165,352,876155,964,0001,009,0002,117,632stderr
7Aug 24, 2026 19:4232,148165,922,114156,515,0001,012,0002,117,632stderr
8Aug 24, 2026 19:4232,688168,606,287159,164,0001,009,0002,117,632stderr
9Aug 24, 2026 19:4233,825175,103,904164,739,0001,005,0002,117,632stderr