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 listMay 18, 2026 01:37M-RochatM-RochatScore: 111,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:38110,575553,614,867540,675,0001,146,0002,113,536
2May 18, 2026 01:38110,669552,092,659541,147,0001,135,0002,113,536
3May 18, 2026 01:38110,685554,566,899541,197,0001,161,0002,113,536
4May 18, 2026 01:38111,051555,074,360542,989,0001,165,0002,113,536
5May 18, 2026 01:38111,138555,363,637543,420,0001,157,0002,113,536
6May 18, 2026 01:38113,935567,595,680557,104,0001,179,0002,113,536
7May 18, 2026 01:38114,103569,770,596557,964,0001,143,0002,113,536
8May 18, 2026 01:38114,382570,002,560559,325,0001,147,0002,113,536
9May 18, 2026 01:38140,795700,455,722688,708,0001,189,0002,113,536