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 27, 2026 15:08Kevin HeaveyKevin HeaveyScore: 63,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:3563,077319,127,349307,551,0001,531,0002,113,536
2Jul 27, 2026 15:3563,111319,317,789307,450,0001,798,00020,480
3Jul 27, 2026 15:3563,134319,397,356306,547,0002,811,0002,113,536
4Jul 27, 2026 15:3563,139319,450,007307,480,0001,905,00020,480
5Jul 27, 2026 15:3563,141319,424,361306,598,0002,794,0002,113,536
6Jul 27, 2026 15:3563,164319,521,667307,626,0001,880,00020,480
7Jul 27, 2026 15:3563,173319,520,682306,687,0002,862,0002,113,536
8Jul 27, 2026 15:3563,207319,714,610306,936,0002,782,0002,113,536
9Jul 27, 2026 15:3563,252320,052,368306,971,0002,967,00020,480