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:38M-RochatM-RochatScore: 110,935Success
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:40110,493553,004,708540,260,0001,158,0002,113,536
2May 18, 2026 01:40110,514552,697,910540,353,0001,169,0002,113,536
3May 18, 2026 01:40110,516550,944,776540,389,0001,141,0002,113,536
4May 18, 2026 01:40110,711551,920,884541,348,0001,137,0002,113,536
5May 18, 2026 01:40110,935554,851,383542,405,0001,180,0002,113,536
6May 18, 2026 01:40111,028554,239,006542,883,0001,156,0002,113,536
7May 18, 2026 01:40113,837568,036,887556,634,0001,168,0002,113,536
8May 18, 2026 01:40134,697669,416,861658,863,0001,153,0002,113,536
9May 18, 2026 01:40149,641742,820,411732,081,0001,162,0002,113,536