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 listAug 3, 2026 21:19anboto1anboto1Score: 57,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:2057,576290,521,666280,992,0001,133,0002,113,536
2Aug 3, 2026 21:2057,577290,618,519281,015,0001,116,0002,113,536
3Aug 3, 2026 21:2057,579291,185,760281,007,0001,132,0002,113,536
4Aug 3, 2026 21:2057,620290,797,007281,229,0001,109,0002,113,536
5Aug 3, 2026 21:2057,628290,771,445281,145,0001,237,0002,113,536
6Aug 3, 2026 21:2057,635291,484,395281,296,0001,116,0002,113,536
7Aug 3, 2026 21:2057,680291,099,931281,407,0001,227,0002,113,536
8Aug 3, 2026 21:2057,763291,558,624281,921,0001,119,0002,113,536
9Aug 3, 2026 21:2059,155298,983,247288,740,0001,124,0002,113,536