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 24, 2026 15:28Andrew EpsteinAndrew EpsteinScore: 234,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:28234,1911,158,556,0401,146,534,0001,004,0002,117,632stderr
2Sep 24, 2026 15:28234,2081,158,024,9991,146,619,0001,001,0002,117,632stderr
3Sep 24, 2026 15:28234,2241,158,337,4091,146,683,0001,016,0002,117,632stderr
4Sep 24, 2026 15:28234,2251,158,358,6551,146,690,0001,013,0002,117,632stderr
5Sep 24, 2026 15:28234,2361,158,077,5361,146,758,0001,001,0002,117,632stderr
6Sep 24, 2026 15:28234,2881,167,345,7301,147,014,0001,000,0002,117,632stderr
7Sep 24, 2026 15:28234,3601,158,778,3781,147,364,0001,003,0002,117,632stderr
8Sep 24, 2026 15:28234,4391,159,137,1421,147,747,0001,007,0002,117,632stderr
9Sep 24, 2026 15:28234,4491,159,221,4781,147,789,0001,015,0002,117,632stderr