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 13:05Josu San MartinJosu San MartinScore: 32,107Success
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 13:0632,056167,127,655155,935,0001,143,0002,113,536
2Aug 2, 2026 13:0632,072167,189,925156,061,0001,095,0002,113,536
3Aug 2, 2026 13:0632,086167,240,227156,101,0001,124,0002,113,536
4Aug 2, 2026 13:0632,099168,126,030156,177,0001,109,0002,113,536
5Aug 2, 2026 13:0632,107167,416,366156,196,0001,129,0002,113,536
6Aug 2, 2026 13:0632,135167,490,664156,330,0001,136,0002,113,536
7Aug 2, 2026 13:0632,185167,870,853156,592,0001,116,0002,113,536
8Aug 2, 2026 13:0632,217167,950,291156,755,0001,110,0002,113,536
9Aug 2, 2026 13:0632,346168,468,835157,385,0001,113,0002,113,536