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 3, 2026 18:01Josu San MartinJosu San MartinScore: 31,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 18:0231,492162,788,639153,300,0001,012,0002,113,536
2Aug 3, 2026 18:0231,514164,034,882153,415,0001,005,0002,113,536
3Aug 3, 2026 18:0231,536162,639,620153,479,0001,052,0002,113,536
4Aug 3, 2026 18:0231,561163,151,665153,394,0001,258,0002,113,536
5Aug 3, 2026 18:0231,617170,528,526153,892,0001,034,0002,113,536
6Aug 3, 2026 18:0231,718165,430,478154,396,0001,027,0002,113,536
7Aug 3, 2026 18:0232,813178,883,148159,759,0001,025,0002,113,536
8Aug 3, 2026 18:0235,755183,607,156174,161,0001,042,0002,113,536
9Aug 3, 2026 18:0238,334196,005,699186,804,0001,036,0002,113,536