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 20:58Josu San MartinJosu San MartinScore: 26,026Success
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 20:5825,938136,187,327125,836,0001,262,0002,113,536
2Aug 4, 2026 20:5825,958136,243,094125,937,0001,258,0002,113,536
3Aug 4, 2026 20:5825,968135,589,082125,974,0001,272,0002,113,536
4Aug 4, 2026 20:5826,016135,885,549126,219,0001,263,0002,113,536
5Aug 4, 2026 20:5826,026135,931,342126,278,0001,254,0002,113,536
6Aug 4, 2026 20:5826,100136,411,028126,885,0001,006,0002,113,536
7Aug 4, 2026 20:5826,117136,340,029126,716,0001,259,0002,113,536
8Aug 4, 2026 20:5826,655139,645,031129,359,0001,253,0002,113,536
9Aug 4, 2026 20:5826,774140,231,477129,943,0001,250,0002,113,536