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 4, 2026 18:21Josu San MartinJosu San MartinScore: 27,703Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 18:2227,591144,254,790133,921,0001,275,0002,113,536
2Aug 4, 2026 18:2227,614143,830,932134,036,0001,274,0002,113,536
3Aug 4, 2026 18:2227,667145,350,518134,292,0001,278,0002,113,536
4Aug 4, 2026 18:2227,703144,160,693134,474,0001,274,0002,113,536
5Aug 4, 2026 18:2227,703144,110,911134,490,0001,259,0002,113,536
6Aug 4, 2026 18:2227,715144,429,563134,741,0001,065,0002,113,536
7Aug 4, 2026 18:2227,973146,240,837135,808,0001,261,0002,113,536
8Aug 4, 2026 18:2228,277147,034,715137,300,0001,259,0002,113,536
9Aug 4, 2026 18:2228,547152,550,466138,616,0001,268,0002,113,536