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 16, 2026 22:59Tomislav TunkovicTomislav TunkovicScore: 46,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 01:4146,692240,204,612226,782,0002,010,00024,576
2Aug 17, 2026 01:4146,746239,634,287227,050,0002,006,00024,576
3Aug 17, 2026 01:4146,852239,580,350227,562,0002,015,00024,576
4Aug 17, 2026 01:4146,855239,550,155227,582,0002,009,00024,576
5Aug 17, 2026 01:4146,872239,462,598227,655,0002,019,00024,576
6Aug 17, 2026 01:4146,874240,365,001227,675,0002,009,00024,576
7Aug 17, 2026 01:4147,337241,847,803229,948,0002,008,00024,576
8Aug 17, 2026 01:4147,578243,021,824231,127,0002,009,00024,576
9Aug 17, 2026 01:4147,593243,381,607231,202,0002,008,00024,576