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:34M-RochatM-RochatScore: 110,921Success
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:36110,557551,962,611540,551,0001,180,0002,113,536
2May 18, 2026 01:36110,693555,019,817541,195,0001,204,0002,113,536
3May 18, 2026 01:36110,693555,052,336541,227,0001,169,0002,113,536
4May 18, 2026 01:36110,790555,176,000541,709,0001,163,0002,113,536
5May 18, 2026 01:36110,921555,077,478542,336,0001,181,0002,113,536
6May 18, 2026 01:36113,850570,142,031556,712,0001,156,0002,113,536
7May 18, 2026 01:36114,153570,997,729558,194,0001,158,0002,113,536
8May 18, 2026 01:36114,440571,438,221559,608,0001,150,0002,113,536
9May 18, 2026 01:36114,555571,981,852560,149,0001,173,0002,113,536