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 listSep 12, 2026 05:16Haha ExpertHaha ExpertScore: 406,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 05:17406,5182,002,104,5741,990,934,0001,006,0002,113,536
2Sep 12, 2026 05:17406,5242,002,404,7201,990,842,0001,127,0002,113,536
3Sep 12, 2026 05:17406,5342,002,183,9101,990,996,0001,025,0002,113,536
4Sep 12, 2026 05:17406,5522,002,336,5881,991,102,0001,006,0002,113,536
5Sep 12, 2026 05:17406,5642,004,152,9691,991,101,0001,064,0002,113,536
6Sep 12, 2026 05:17406,6142,002,756,9421,990,375,0002,038,0002,113,536
7Sep 12, 2026 05:17406,6232,003,293,5461,991,428,0001,026,0002,113,536
8Sep 12, 2026 05:17406,6432,002,793,8501,991,508,0001,047,0002,113,536
9Sep 12, 2026 05:17406,7382,003,388,6621,992,020,0001,001,0002,113,536