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:43Yuriy LyfenkoYuriy LyfenkoScore: 63,854Success
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:4361,691322,956,808300,286,0002,001,0002,519,040
2Mar 19, 2026 01:4362,577335,641,212304,628,0001,997,0002,285,568
3Mar 19, 2026 01:4362,606330,836,949303,770,0002,997,0002,514,944
4Mar 19, 2026 01:4362,672329,796,880305,093,0002,000,0002,285,568
5Mar 19, 2026 01:4363,854338,523,606310,885,0001,999,0002,260,992
6Mar 19, 2026 01:4363,856335,412,111311,895,000999,0002,285,568
7Mar 19, 2026 01:4363,874335,865,086309,985,0002,999,0002,514,944
8Mar 19, 2026 01:4375,286392,745,181365,904,0002,999,0002,506,752
9Mar 19, 2026 01:4380,239421,745,962391,171,0002,000,0002,506,752