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:24anboto1anboto1Score: 57,623Success
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:2457,504290,239,082280,680,0001,094,0002,113,536
2Aug 3, 2026 21:2457,513290,384,061280,674,0001,142,0002,113,536
3Aug 3, 2026 21:2457,562290,616,143280,919,0001,137,0002,113,536
4Aug 3, 2026 21:2457,588290,584,978281,099,0001,083,0002,113,536
5Aug 3, 2026 21:2457,623290,810,620281,268,0001,087,0002,113,536
6Aug 3, 2026 21:2457,691291,153,066281,470,0001,218,0002,113,536
7Aug 3, 2026 21:2457,780291,548,435282,031,0001,094,0002,113,536
8Aug 3, 2026 21:2458,452294,898,171285,311,0001,105,0002,113,536
9Aug 3, 2026 21:2458,712296,091,898286,677,0001,015,0002,113,536