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 3, 2026 20:56anboto1anboto1Score: 57,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:5957,531291,026,953280,806,0001,098,0002,113,536
2Aug 3, 2026 20:5957,548290,482,215280,900,0001,090,0002,113,536
3Aug 3, 2026 20:5957,567291,135,442280,950,0001,129,0002,113,536
4Aug 3, 2026 20:5957,581290,576,150281,052,0001,098,0002,113,536
5Aug 3, 2026 20:5957,628291,485,622281,271,0001,110,0002,113,536
6Aug 3, 2026 20:5958,204293,650,967284,039,0001,163,0002,113,536
7Aug 3, 2026 20:5959,002298,251,350288,013,0001,097,0002,113,536
8Aug 3, 2026 20:5959,111298,694,141288,553,0001,093,0002,113,536
9Aug 3, 2026 20:5960,944307,636,888297,537,0001,090,0002,113,536