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 21:12anboto1anboto1Score: 58,005Success
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 21:1457,891292,836,440282,530,0001,137,0002,113,536
2Aug 3, 2026 21:1457,900292,131,778282,620,0001,093,0002,113,536
3Aug 3, 2026 21:1457,946292,421,157282,813,0001,123,0002,113,536
4Aug 3, 2026 21:1457,975292,660,369282,959,0001,122,0002,113,536
5Aug 3, 2026 21:1458,005292,726,930283,033,0001,194,0002,113,536
6Aug 3, 2026 21:1458,011292,443,519283,146,0001,112,0002,113,536
7Aug 3, 2026 21:1458,195293,798,981283,967,0001,189,0002,113,536
8Aug 3, 2026 21:1458,388295,148,585285,020,0001,083,0002,113,536
9Aug 3, 2026 21:1458,433294,777,812285,249,0001,073,0002,113,536