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 18:42anboto1anboto1Score: 222,234Success
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 18:43220,6131,091,115,9861,079,960,0001,044,0002,113,536
2Jul 31, 2026 18:43220,7481,091,614,2111,080,607,0001,063,0002,113,536
3Jul 31, 2026 18:43221,3221,094,417,3281,083,444,0001,037,0002,113,536
4Jul 31, 2026 18:43222,0421,097,917,9381,086,959,0001,047,0002,113,536
5Jul 31, 2026 18:43222,2341,098,814,4801,087,884,0001,066,0002,113,536
6Jul 31, 2026 18:43222,9221,102,206,6881,091,268,0001,052,0002,113,536
7Jul 31, 2026 18:43223,1121,103,121,1431,092,199,0001,052,0002,113,536
8Jul 31, 2026 18:43223,1441,103,386,3241,092,350,0001,060,0002,113,536
9Jul 31, 2026 18:43223,5411,105,208,5051,094,300,0001,051,0002,113,536