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 20:05anboto1anboto1Score: 188,441Success
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 20:06188,133933,204,911920,769,0001,083,0002,113,536
2Jul 31, 2026 20:06188,324932,920,866921,703,0001,087,0002,113,536
3Jul 31, 2026 20:06188,367933,070,842921,929,0001,072,0002,113,536
4Jul 31, 2026 20:06188,416933,266,898922,160,0001,082,0002,113,536
5Jul 31, 2026 20:06188,441933,329,332922,280,0001,085,0002,113,536
6Jul 31, 2026 20:06188,449933,363,186922,311,0001,092,0002,113,536
7Jul 31, 2026 20:06188,463933,502,841922,388,0001,081,0002,113,536
8Jul 31, 2026 20:06188,485933,469,522922,506,0001,071,0002,113,536
9Jul 31, 2026 20:06188,616934,176,495923,137,0001,083,0002,113,536