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 listJul 2, 2026 08:16A_ShamanA_ShamanScore: 191,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 08:17191,025945,410,528933,929,0002,095,0002,113,536
2Jul 2, 2026 08:17191,052945,449,570934,080,0002,078,0002,113,536
3Jul 2, 2026 08:17191,060945,793,316934,065,0002,131,0002,113,536
4Jul 2, 2026 08:17191,133946,013,587934,381,0002,173,0002,113,536
5Jul 2, 2026 08:17191,135946,074,418934,448,0002,116,0002,113,536
6Jul 2, 2026 08:17191,151946,062,087934,480,0002,163,0002,113,536
7Jul 2, 2026 08:17191,165946,093,379934,493,0002,219,0002,113,536
8Jul 2, 2026 08:17191,173946,306,145934,591,0002,159,0002,113,536
9Jul 2, 2026 08:17191,187946,287,031934,745,0002,072,0002,113,536