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:16anboto1anboto1Score: 57,646Success
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:1757,525290,844,652280,777,0001,098,0002,113,536
2Aug 3, 2026 21:1757,529291,001,133280,798,0001,095,0002,113,536
3Aug 3, 2026 21:1757,537290,432,936280,846,0001,089,0002,113,536
4Aug 3, 2026 21:1757,586291,463,889281,078,0001,098,0002,113,536
5Aug 3, 2026 21:1757,646291,006,978281,354,0001,112,0002,113,536
6Aug 3, 2026 21:1757,695291,786,734281,540,0001,166,0002,113,536
7Aug 3, 2026 21:1758,473295,695,386285,373,0001,145,0002,113,536
8Aug 3, 2026 21:1758,656295,909,806286,326,0001,091,0002,113,536
9Aug 3, 2026 21:1758,716296,149,889286,704,0001,005,0002,113,536