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 17:57anboto1anboto1Score: 158,188Success
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 17:57157,876783,844,454772,338,0001,259,0002,113,536
2Jul 31, 2026 17:57158,166785,228,022773,754,0001,262,0002,113,536
3Jul 31, 2026 17:57158,168785,211,878773,773,0001,254,0002,113,536
4Jul 31, 2026 17:57158,187785,220,477773,870,0001,251,0002,113,536
5Jul 31, 2026 17:57158,188785,312,898773,878,0001,246,0002,113,536
6Jul 31, 2026 17:57158,208785,394,835773,972,0001,252,0002,113,536
7Jul 31, 2026 17:57158,328786,088,946774,556,0001,256,0002,113,536
8Jul 31, 2026 17:57158,798788,792,604776,873,0001,240,0002,113,536
9Jul 31, 2026 17:57158,877788,636,805777,248,0001,251,0002,113,536