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 31, 2026 19:13anboto1anboto1Score: 146,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:13145,632723,484,934712,535,0001,065,0002,113,536
2Jul 31, 2026 19:13145,724723,964,890712,972,0001,077,0002,113,536
3Jul 31, 2026 19:13145,759724,887,218713,140,0001,083,0002,113,536
4Jul 31, 2026 19:13145,774724,333,297713,208,0001,089,0002,113,536
5Jul 31, 2026 19:13146,056725,717,491714,597,0001,080,0002,113,536
6Jul 31, 2026 19:13146,162726,350,064715,118,0001,078,0002,113,536
7Jul 31, 2026 19:13146,216726,437,612715,381,0001,082,0002,113,536
8Jul 31, 2026 19:13146,217726,343,624715,388,0001,079,0002,113,536
9Jul 31, 2026 19:13146,493727,924,637716,746,0001,074,0002,113,536