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 2, 2026 14:39Josu San MartinJosu San MartinScore: 34,198Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:4034,128177,894,240166,102,0001,128,0002,113,536
2Aug 2, 2026 14:4034,154177,348,594166,239,0001,118,0002,113,536
3Aug 2, 2026 14:4034,164177,376,331166,292,0001,113,0002,113,536
4Aug 2, 2026 14:4034,185177,536,009166,392,0001,117,0002,113,536
5Aug 2, 2026 14:4034,198177,881,613166,450,0001,122,0002,113,536
6Aug 2, 2026 14:4034,655179,828,293168,697,0001,115,0002,113,536
7Aug 2, 2026 14:4034,657181,721,371168,697,0001,126,0002,113,536
8Aug 2, 2026 14:4034,713180,141,691168,964,0001,131,0002,113,536
9Aug 2, 2026 14:4039,781204,911,868193,807,0001,123,0002,113,536