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 00:00A_ShamanA_ShamanScore: 150,560Success
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 00:01150,444747,000,426734,170,0003,007,0002,138,112
2Jun 28, 2026 00:01150,507747,387,980734,479,0003,006,0002,138,112
3Jun 28, 2026 00:01150,520747,328,451734,541,0003,009,0002,138,112
4Jun 28, 2026 00:01150,531747,362,448734,602,0003,004,0002,138,112
5Jun 28, 2026 00:01150,560747,510,510734,741,0003,007,0002,138,112
6Jun 28, 2026 00:01150,562747,680,695734,751,0003,006,0002,138,112
7Jun 28, 2026 00:01150,604747,709,248734,957,0003,007,0002,138,112
8Jun 28, 2026 00:01150,646748,048,965735,164,0003,005,0002,138,112
9Jun 28, 2026 00:01150,720748,411,491735,524,0003,008,0002,138,112