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 listAug 2, 2026 12:11anboto1anboto1Score: 165,863Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 12:13165,349820,250,536808,995,0001,217,0002,113,536
2Aug 2, 2026 12:13165,639821,741,618810,422,0001,210,0002,113,536
3Aug 2, 2026 12:13165,696822,033,395810,685,0001,230,0002,113,536
4Aug 2, 2026 12:13165,701822,045,442810,709,0001,229,0002,113,536
5Aug 2, 2026 12:13165,863822,822,966811,503,0001,229,0002,113,536
6Aug 2, 2026 12:13166,326825,086,134813,772,0001,230,0002,113,536
7Aug 2, 2026 12:13167,301829,920,429818,557,0001,222,0002,113,536
8Aug 2, 2026 12:13167,926832,870,454821,603,0001,239,0002,113,536
9Aug 2, 2026 12:13168,460836,367,713824,227,0001,231,0002,113,536