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 listMar 10, 2026 04:12olliecrowolliecrowScore: 102,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 04:12102,213533,658,198499,846,000999,0002,330,624
2Mar 10, 2026 04:12102,219527,036,059499,873,000999,0002,281,472
3Mar 10, 2026 04:12102,221527,478,376498,882,0001,999,0002,281,472
4Mar 10, 2026 04:12102,227528,972,502498,913,0001,999,0002,330,624
5Mar 10, 2026 04:12102,232531,011,476498,937,0001,999,0002,281,472
6Mar 10, 2026 04:12102,296522,317,624501,251,00002,281,472
7Mar 10, 2026 04:12102,516526,592,381501,329,0001,000,0002,281,472
8Mar 10, 2026 04:12102,552535,019,976500,505,0001,998,0002,330,624
9Mar 10, 2026 04:12102,557530,855,851500,531,0001,998,0002,281,472