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:44anboto1anboto1Score: 128,409Success
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:45127,089632,964,836621,376,0001,362,0002,113,536
2Jul 31, 2026 21:45127,090633,657,134621,381,0001,361,0002,113,536
3Jul 31, 2026 21:45127,571635,285,002623,730,0001,372,0002,113,536
4Jul 31, 2026 21:45127,634635,664,718624,057,0001,354,0002,113,536
5Jul 31, 2026 21:45128,409639,420,052627,850,0001,356,0002,113,536
6Jul 31, 2026 21:45128,760641,049,478629,579,0001,349,0002,113,536
7Jul 31, 2026 21:45129,027643,263,224630,861,0001,372,0002,113,536
8Jul 31, 2026 21:45129,115642,936,441631,282,0001,386,0002,113,536
9Jul 31, 2026 21:45131,036652,305,553640,720,0001,358,0002,113,536