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 21:19olliecrowolliecrowScore: 108,679Success
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 21:18108,560558,910,188530,947,000999,0002,289,664
2Mar 19, 2026 21:18108,604556,202,571531,162,0001,000,0002,306,048
3Mar 19, 2026 21:18108,640563,624,490531,337,0001,000,0002,289,664
4Mar 19, 2026 21:18108,649561,016,215532,378,00002,306,048
5Mar 19, 2026 21:18108,675556,827,427529,509,0002,997,0002,285,568
6Mar 19, 2026 21:19108,678558,055,784530,525,0001,998,0002,289,664
7Mar 19, 2026 21:18108,679562,649,060531,529,000999,0002,293,760
8Mar 19, 2026 21:19108,683562,518,311530,551,0001,998,0002,306,048
9Mar 19, 2026 21:18108,686559,761,248531,560,000999,0002,289,664
10Mar 19, 2026 21:18108,692565,159,770530,591,0001,998,0002,293,760
11Mar 19, 2026 21:18108,737565,964,535530,811,0001,999,0002,293,760
12Mar 19, 2026 21:19108,771560,988,631531,981,000999,0002,289,664