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 11, 2026 16:22olliecrowolliecrowScore: 96,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 16:2296,849499,620,978472,560,0001,998,0002,281,472
2Mar 11, 2026 16:2096,850505,907,267472,566,0001,998,0002,453,504
3Mar 11, 2026 16:2096,851500,540,306472,570,0001,998,0002,281,472
4Mar 11, 2026 16:2096,858505,322,451473,606,000999,0002,281,472
5Mar 11, 2026 16:2096,858499,623,698473,607,000999,0002,281,472
6Mar 11, 2026 16:2096,861508,677,122474,619,00002,281,472
7Mar 11, 2026 16:2296,864498,923,388473,637,000999,0002,281,472
8Mar 11, 2026 16:2096,873506,416,362473,680,000999,0002,281,472
9Mar 11, 2026 16:2096,880505,352,982473,711,000999,0002,326,528
10Mar 11, 2026 16:2096,880500,971,683473,711,000999,0002,334,720
11Mar 11, 2026 16:2296,888505,013,671472,755,0001,998,0002,330,624
12Mar 11, 2026 16:2097,079503,452,795474,688,000999,0002,433,024