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 24, 2026 01:24Dominique GarmierDominique GarmierScore: 357,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 22:24357,7041,778,896,2321,749,751,0002,997,0002,285,568
2Mar 23, 2026 22:24357,7071,790,231,7581,749,766,0002,997,0002,293,760
3Mar 23, 2026 22:24357,7291,782,640,5271,749,874,0002,998,0002,379,776
4Mar 24, 2026 01:24357,7471,781,858,3491,751,963,000999,0002,293,760
5Mar 24, 2026 01:24357,8641,786,782,5011,750,536,0002,997,0002,523,136
6Mar 24, 2026 01:24360,6151,791,650,2721,764,016,0002,998,0002,383,872