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 18:07Josu San MartinJosu San MartinScore: 30,282Success
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 18:0830,210158,132,607146,903,0001,127,0002,113,536
2Aug 2, 2026 18:0830,212158,798,147146,908,0001,133,0002,113,536
3Aug 2, 2026 18:0830,215158,786,810146,942,0001,113,0002,113,536
4Aug 2, 2026 18:0830,233158,296,680147,014,0001,129,0002,113,536
5Aug 2, 2026 18:0830,282159,998,194147,267,0001,116,0002,113,536
6Aug 2, 2026 18:0830,313159,419,509147,416,0001,120,0002,113,536
7Aug 2, 2026 18:0830,430159,935,457147,974,0001,137,0002,113,536
8Aug 2, 2026 18:0830,601160,160,009148,816,0001,130,0002,113,536
9Aug 2, 2026 18:0830,754161,479,338149,542,0001,156,0002,113,536