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:23anboto1anboto1Score: 57,693Success
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:2357,535291,019,286280,814,0001,108,0002,113,536
2Aug 3, 2026 21:2357,543291,154,724280,817,0001,148,0002,113,536
3Aug 3, 2026 21:2357,582291,164,949281,043,0001,113,0002,113,536
4Aug 3, 2026 21:2357,631290,940,872281,378,0001,015,0002,113,536
5Aug 3, 2026 21:2357,693291,147,760281,602,0001,098,0002,113,536
6Aug 3, 2026 21:2357,777292,214,163281,957,0001,152,0002,113,536
7Aug 3, 2026 21:2357,790291,680,721282,058,0001,117,0002,113,536
8Aug 3, 2026 21:2357,977293,132,874282,992,0001,100,0002,113,536
9Aug 3, 2026 21:2358,082293,686,596283,463,0001,142,0002,113,536