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:57anboto1anboto1Score: 57,778Success
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,542291,816,713280,864,0001,094,0002,113,536
2Aug 3, 2026 20:5957,575290,592,302280,936,0001,185,0002,113,536
3Aug 3, 2026 20:5957,576291,182,163281,021,0001,105,0002,113,536
4Aug 3, 2026 20:5957,580293,481,876281,028,0001,115,0002,113,536
5Aug 3, 2026 20:5957,778292,155,626281,969,0001,146,0002,113,536
6Aug 3, 2026 20:5957,991293,222,869283,004,0001,155,0002,113,536
7Aug 3, 2026 20:5958,480295,234,233285,310,0001,246,0002,113,536
8Aug 3, 2026 20:5958,673296,496,284286,365,0001,133,0002,113,536
9Aug 3, 2026 20:5958,725296,795,786286,636,0001,120,0002,113,536