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 20:27anboto1anboto1Score: 57,809Success
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 20:2857,648291,133,262281,321,0001,159,0002,113,536
2Aug 3, 2026 20:2857,691291,015,370281,541,0001,148,0002,113,536
3Aug 3, 2026 20:2857,696291,270,582281,507,0001,204,0002,113,536
4Aug 3, 2026 20:2857,757291,561,932281,829,0001,185,0002,113,536
5Aug 3, 2026 20:2857,809291,749,325282,138,0001,128,0002,113,536
6Aug 3, 2026 20:2857,856291,966,805282,327,0001,170,0002,113,536
7Aug 3, 2026 20:2858,080293,186,198283,472,0001,122,0002,113,536
8Aug 3, 2026 20:2858,361298,933,120284,841,0001,132,0002,113,536
9Aug 3, 2026 20:2858,732296,283,971286,664,0001,124,0002,113,536