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 16:28Josu San MartinJosu San MartinScore: 28,185Success
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 16:2927,994145,653,189136,158,0001,013,0002,113,536
2Aug 3, 2026 16:2927,999145,721,530135,926,0001,270,0002,113,536
3Aug 3, 2026 16:2927,999146,294,216136,194,0001,003,0002,113,536
4Aug 3, 2026 16:2928,004146,358,450136,073,0001,147,0002,113,536
5Aug 3, 2026 16:2928,185146,462,196137,093,0001,018,0002,113,536
6Aug 3, 2026 16:2928,373148,023,853137,768,0001,262,0002,113,536
7Aug 3, 2026 16:2928,411148,260,330137,945,0001,270,0002,113,536
8Aug 3, 2026 16:2928,430148,484,000138,049,0001,261,0002,113,536
9Aug 3, 2026 16:2928,471147,951,034138,488,0001,020,0002,113,536