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:36anboto1anboto1Score: 146,078Success
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:37145,861724,636,227713,350,0001,373,0002,113,536
2Jul 31, 2026 19:37145,967725,147,515713,873,0001,366,0002,113,536
3Jul 31, 2026 19:37146,000729,372,325714,008,0001,394,0002,113,536
4Jul 31, 2026 19:37146,022725,655,837714,130,0001,382,0002,113,536
5Jul 31, 2026 19:37146,078725,781,651713,274,0002,510,0002,113,536
6Jul 31, 2026 19:37146,112725,809,283714,507,0001,446,0002,113,536
7Jul 31, 2026 19:37146,132726,026,332714,675,0001,375,0002,113,536
8Jul 31, 2026 19:37146,190726,318,196714,955,0001,380,0002,113,536
9Jul 31, 2026 19:37146,204726,390,149715,017,0001,385,0002,113,536