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 11:40Josu San MartinJosu San MartinScore: 26,217Success
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 11:4026,173137,902,262126,996,0001,256,0002,113,536
2Aug 4, 2026 11:4026,199137,459,659127,368,0001,009,0002,113,536
3Aug 4, 2026 11:4026,200137,487,955127,107,0001,275,0002,113,536
4Aug 4, 2026 11:4026,203136,739,653127,368,0001,031,0002,113,536
5Aug 4, 2026 11:4026,217137,592,118127,197,0001,270,0002,113,536
6Aug 4, 2026 11:4026,226136,840,993127,239,0001,270,0002,113,536
7Aug 4, 2026 11:4026,265137,786,120127,438,0001,263,0002,113,536
8Aug 4, 2026 11:4026,279137,100,070127,516,0001,255,0002,113,536
9Aug 4, 2026 11:4026,458138,661,406128,639,0001,010,0002,113,536