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 16:38Josu San MartinJosu San MartinScore: 30,285Success
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 16:3830,267158,650,029147,185,0001,124,0002,113,536
2Aug 2, 2026 16:3830,276159,064,660147,228,0001,126,0002,113,536
3Aug 2, 2026 16:3830,279158,389,788147,240,0001,131,0002,113,536
4Aug 2, 2026 16:3830,285158,449,988147,272,0001,129,0002,113,536
5Aug 2, 2026 16:3830,285159,125,760147,280,0001,118,0002,113,536
6Aug 2, 2026 16:3830,287159,197,739147,281,0001,129,0002,113,536
7Aug 2, 2026 16:3830,306159,238,283147,386,0001,115,0002,113,536
8Aug 2, 2026 16:3830,600160,106,666148,817,0001,126,0002,113,536
9Aug 2, 2026 16:3831,829166,725,529154,818,0001,145,0002,113,536