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 21:06anboto1anboto1Score: 153,411Success
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 21:06153,172761,214,964749,230,0001,317,0002,113,536
2Jul 31, 2026 21:06153,224760,754,315749,497,0001,305,0002,113,536
3Jul 31, 2026 21:06153,226761,542,386749,495,0001,313,0002,113,536
4Jul 31, 2026 21:06153,285761,216,673749,793,0001,305,0002,113,536
5Jul 31, 2026 21:06153,411761,738,680750,412,0001,302,0002,113,536
6Jul 31, 2026 21:06153,555762,494,902751,120,0001,300,0002,113,536
7Jul 31, 2026 21:06153,588763,263,848751,268,0001,318,0002,113,536
8Jul 31, 2026 21:06153,713763,214,973751,877,0001,317,0002,113,536
9Jul 31, 2026 21:06153,807764,011,856752,331,0001,327,0002,113,536