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 19, 2026 20:23olliecrowolliecrowScore: 93,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 20:1393,694483,669,999458,101,0001,000,0002,371,584
2Mar 19, 2026 20:1393,707482,658,340458,164,0001,000,0002,535,424
3Mar 19, 2026 20:2393,714484,541,473457,203,0001,996,0002,277,376
4Mar 19, 2026 20:1393,724483,931,040458,247,0001,000,0002,375,680
5Mar 19, 2026 20:1393,726484,816,162458,257,0001,000,0002,277,376
6Mar 19, 2026 20:1393,727491,417,933458,262,0001,000,0002,277,376
7Mar 19, 2026 20:2393,729479,647,351458,271,0001,000,0002,277,376
8Mar 19, 2026 20:2393,730482,298,596458,275,0001,000,0002,465,792
9Mar 19, 2026 20:1393,742491,003,159458,334,0001,000,0002,277,376
10Mar 19, 2026 20:1393,780486,239,073459,522,00002,277,376
11Mar 19, 2026 20:1393,780486,009,717457,527,0001,997,0002,375,680
12Mar 19, 2026 20:1393,800481,659,260458,623,000999,0002,277,376