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:50olliecrowolliecrowScore: 122,347Success
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:50121,930626,192,177594,462,0002,997,0002,285,568
2Feb 13, 2026 12:50122,068627,803,232597,132,0001,000,0002,306,048
3Feb 13, 2026 12:50122,258630,082,785595,064,0004,000,0002,285,568
4Feb 13, 2026 12:50122,345624,417,799597,491,0001,998,0002,310,144
5Feb 13, 2026 12:50122,347629,102,048595,503,0003,996,0002,314,240
6Feb 13, 2026 12:50123,751637,863,473603,380,0003,001,0002,285,568
7Feb 13, 2026 12:50124,593639,344,745608,507,0001,998,0002,285,568
8Feb 13, 2026 12:50125,365643,241,752612,288,0002,000,0002,392,064
9Feb 13, 2026 12:50125,861644,332,530614,719,0001,999,0002,285,568