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 listJul 30, 2025 23:36zielajzielajScore: 24,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 23:3624,254139,139,210115,849,0002,996,0002,297,856
2Jul 30, 2025 23:3624,282143,012,174117,982,000999,0002,347,008
3Jul 30, 2025 23:3624,289140,665,834117,014,0002,000,0002,465,792
4Jul 30, 2025 23:3624,292143,220,359118,033,0001,000,0002,465,792
5Jul 30, 2025 23:3624,298138,722,896117,060,0002,001,0002,297,856
6Jul 30, 2025 23:3624,301140,885,096117,074,0002,001,0002,478,080
7Jul 30, 2025 23:3624,307139,102,599118,104,0001,000,0002,383,872
8Jul 30, 2025 23:3626,074149,842,777125,767,0001,996,0002,322,432
9Jul 30, 2025 23:3626,204153,515,787126,393,0002,006,0002,318,336