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 18:47olliecrowolliecrowScore: 102,599Success
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 18:47102,412530,850,373500,822,000997,0002,289,664
2Feb 13, 2026 18:47102,423528,977,207500,874,000997,0002,289,664
3Feb 13, 2026 18:47102,476530,071,390500,135,0001,996,0002,281,472
4Feb 13, 2026 18:47102,580530,361,366500,644,0001,998,0002,314,240
5Feb 13, 2026 18:47102,599531,429,365501,735,000999,0002,314,240
6Feb 13, 2026 18:47102,615534,255,544500,815,0001,999,0002,318,336
7Feb 13, 2026 18:47102,622529,010,183501,847,000999,0002,289,664
8Feb 13, 2026 18:47102,623526,355,201501,855,000999,0002,318,336
9Feb 13, 2026 18:47102,668522,797,775502,071,0001,000,0002,289,664