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:19anboto1anboto1Score: 57,986Success
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:1957,603291,340,425281,126,0001,131,0002,113,536
2Aug 3, 2026 20:1957,607291,410,715281,081,0001,196,0002,113,536
3Aug 3, 2026 20:1957,637291,585,179281,298,0001,124,0002,113,536
4Aug 3, 2026 20:1957,655291,663,822281,397,0001,117,0002,113,536
5Aug 3, 2026 20:1957,986293,309,126282,994,0001,138,0002,113,536
6Aug 3, 2026 20:1958,030293,523,695283,098,0001,252,0002,113,536
7Aug 3, 2026 20:1958,740296,581,691286,691,0001,139,0002,113,536
8Aug 3, 2026 20:1958,803297,234,646287,033,0001,106,0002,113,536
9Aug 3, 2026 20:1959,344299,884,084289,664,0001,122,0002,113,536