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 31, 2026 17:36anboto1anboto1Score: 177,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:37176,696877,865,845862,811,0003,004,0002,125,824
2Jul 31, 2026 17:37176,961877,955,797864,102,0003,007,0002,125,824
3Jul 31, 2026 17:37177,012878,134,915864,357,0003,006,0002,125,824
4Jul 31, 2026 17:37177,379879,912,116866,144,0003,016,0002,125,824
5Jul 31, 2026 17:37177,775881,799,065868,095,0003,007,0002,125,824
6Jul 31, 2026 17:37177,777881,715,296868,105,0003,004,0002,125,824
7Jul 31, 2026 17:37177,917882,240,834868,786,0003,009,0002,125,824
8Jul 31, 2026 17:37177,996883,043,247869,178,0003,003,0002,125,824
9Jul 31, 2026 17:37178,410884,851,579871,201,0003,011,0002,125,824