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 04:48anboto1anboto1Score: 59,330Success
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 04:4959,246300,372,462289,197,0001,110,0002,113,536
2Aug 3, 2026 04:4959,294300,904,662289,419,0001,122,0002,113,536
3Aug 3, 2026 04:4959,306300,790,909289,474,0001,130,0002,113,536
4Aug 3, 2026 04:4959,320301,522,627289,549,0001,122,0002,113,536
5Aug 3, 2026 04:4959,330300,799,603289,598,0001,120,0002,113,536
6Aug 3, 2026 04:4959,332301,602,964289,621,0001,106,0002,113,536
7Aug 3, 2026 04:4959,782302,935,971291,829,0001,106,0002,113,536
8Aug 3, 2026 04:4959,967303,866,793292,724,0001,119,0002,113,536
9Aug 3, 2026 04:4969,821352,285,330340,995,0001,131,0002,113,536