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 1, 2026 02:59Josu San MartinJosu San MartinScore: 35,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 03:0035,697185,035,824173,805,0001,112,0002,113,536
2Aug 1, 2026 03:0035,700185,836,443173,801,0001,129,0002,113,536
3Aug 1, 2026 03:0035,708185,886,692173,834,0001,139,0002,113,536
4Aug 1, 2026 03:0035,712185,185,866173,858,0001,133,0002,113,536
5Aug 1, 2026 03:0035,712185,184,244173,847,0001,142,0002,113,536
6Aug 1, 2026 03:0035,721185,960,473173,904,0001,130,0002,113,536
7Aug 1, 2026 03:0035,724185,213,095173,923,0001,129,0002,113,536
8Aug 1, 2026 03:0035,729185,306,458173,953,0001,122,0002,113,536
9Aug 1, 2026 03:0036,565190,799,484178,034,0001,136,0002,113,536