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 15, 2026 13:40limanjun99limanjun99Score: 182,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 13:40182,147917,099,200888,524,0003,997,0002,265,088
2Mar 15, 2026 13:40182,192919,634,847890,743,0001,999,0002,265,088
3Mar 15, 2026 13:40182,531920,111,352891,403,0002,997,0002,273,280
4Mar 15, 2026 13:40182,750925,322,429892,479,0002,998,0002,265,088
5Mar 15, 2026 13:40182,862919,825,861894,025,0002,000,0002,289,664
6Mar 15, 2026 13:40183,139922,627,044895,382,0001,998,0002,289,664
7Mar 15, 2026 13:40185,192933,909,950904,445,0002,998,0002,289,664
8Mar 15, 2026 13:40186,197937,520,990909,368,0002,997,0002,265,088
9Mar 15, 2026 13:40186,330937,983,772911,015,0002,000,0002,285,568