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 19, 2026 01:51Yuriy LyfenkoYuriy LyfenkoScore: 61,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 01:5161,377327,282,069297,749,0002,997,0002,514,944
2Mar 19, 2026 01:5161,406324,841,472297,891,0002,998,0002,514,944
3Mar 19, 2026 01:5161,410323,191,588298,909,0001,999,0002,514,944
4Mar 19, 2026 01:5161,439323,720,080298,051,0003,000,0002,506,752
5Mar 19, 2026 01:5161,489325,471,650299,294,0002,001,0002,285,568
6Mar 19, 2026 01:5161,506330,576,511299,379,0002,002,0002,277,376
7Mar 19, 2026 01:5162,379331,624,355302,663,0002,996,0002,285,568
8Mar 19, 2026 01:5162,420329,655,483302,858,0002,998,0002,285,568
9Mar 19, 2026 01:5162,506333,211,651304,276,0002,001,0002,506,752