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 21:18Josu San MartinJosu San MartinScore: 30,844Success
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 21:1930,788161,703,832149,735,0001,127,0002,113,536
2Aug 2, 2026 21:1930,812161,156,314149,854,0001,127,0002,113,536
3Aug 2, 2026 21:1930,825161,465,199149,908,0001,136,0002,113,536
4Aug 2, 2026 21:1930,834161,077,710149,962,0001,127,0002,113,536
5Aug 2, 2026 21:1930,844161,245,657150,007,0001,129,0002,113,536
6Aug 2, 2026 21:1930,894162,170,341150,244,0001,141,0002,113,536
7Aug 2, 2026 21:1930,933162,547,210150,445,0001,130,0002,113,536
8Aug 2, 2026 21:1931,069163,025,894151,113,0001,129,0002,113,536
9Aug 2, 2026 21:1931,215163,043,216151,832,0001,126,0002,113,536