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 listMar 25, 2026 21:08Dominique GarmierDominique GarmierScore: 171,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 17:30170,057860,008,146831,282,0001,998,0002,277,376
2Mar 25, 2026 20:32170,697858,515,697834,419,0001,998,0002,277,376
3Mar 25, 2026 17:30170,824866,034,360836,039,0001,000,0002,527,232
4Mar 25, 2026 21:08171,031863,720,592836,057,0001,997,0002,289,664
5Mar 25, 2026 17:30171,734864,874,198839,497,0001,998,0002,531,328
6Mar 25, 2026 20:32171,750866,036,288840,575,000999,0002,449,408
7Mar 25, 2026 20:32172,008870,049,174840,841,0001,999,0002,289,664
8Mar 25, 2026 21:08176,347903,552,593861,102,0002,996,0002,289,664
9Mar 25, 2026 21:08179,093909,061,025871,560,0005,996,0002,277,376