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 listNov 11, 2025 00:05izotoffizotoffScore: 987,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 00:05987,0004,863,843,5174,835,302,000999,0002,428,928
2Nov 11, 2025 00:05987,0454,869,729,1524,835,521,000999,0002,326,528
3Nov 11, 2025 00:05987,0664,868,988,6894,834,624,0001,998,0002,326,528
4Nov 11, 2025 00:05987,0914,868,718,0944,832,748,0003,997,0002,424,832
5Nov 11, 2025 00:05987,0984,861,433,7844,833,781,0002,998,0002,326,528
6Nov 11, 2025 00:05987,1074,868,616,6714,834,827,0001,999,0002,326,528
7Nov 11, 2025 00:05987,1274,867,599,1804,830,926,0005,996,0002,428,928
8Nov 11, 2025 00:05987,1434,869,343,1094,833,003,0003,997,0002,326,528
9Nov 11, 2025 00:05987,1674,866,250,5534,835,118,0001,998,0002,326,528