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 listJun 28, 2026 09:14A_ShamanA_ShamanScore: 203,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:15203,5071,006,542,432995,131,0002,055,0002,113,536
2Jun 28, 2026 09:15203,5501,006,805,227995,370,0002,025,0002,113,536
3Jun 28, 2026 09:15203,5611,006,791,863995,402,0002,049,0002,113,536
4Jun 28, 2026 09:15203,5661,006,955,882995,397,0002,078,0002,113,536
5Jun 28, 2026 09:15203,5771,006,878,682995,522,0002,010,0002,113,536
6Jun 28, 2026 09:15203,6881,007,656,010996,042,0002,034,0002,113,536
7Jun 28, 2026 09:15203,7151,007,801,785996,125,0002,083,0002,113,536
8Jun 28, 2026 09:15203,7351,007,601,669996,246,0002,057,0002,113,536
9Jun 28, 2026 09:15204,1861,009,913,671998,462,0002,051,0002,113,536