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 listFeb 13, 2026 12:44olliecrowolliecrowScore: 132,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 12:44131,728673,459,239642,468,0002,997,0002,314,240
2Feb 13, 2026 12:44131,844670,501,006644,034,0002,000,0002,289,664
3Feb 13, 2026 12:44132,005673,873,138643,826,0002,999,0002,306,048
4Feb 13, 2026 12:44132,074671,539,125645,161,0002,000,0002,301,952
5Feb 13, 2026 12:44132,119676,259,743646,385,0001,000,0002,289,664
6Feb 13, 2026 12:44132,207673,124,583644,813,0002,999,0002,306,048
7Feb 13, 2026 12:44132,412675,954,281646,822,0001,999,0002,306,048
8Feb 13, 2026 12:44132,500678,953,644645,248,0004,001,0002,289,664
9Feb 13, 2026 12:44132,877674,773,460647,095,0004,000,0002,306,048