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 listApr 3, 2026 14:39limanjun99limanjun99Score: 136,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 14:39136,833693,188,580668,484,0001,998,0002,293,760
2Apr 3, 2026 14:39136,862695,066,717668,624,0001,998,0002,293,760
3Apr 3, 2026 14:39136,892694,289,459667,771,0002,998,0002,375,680
4Apr 3, 2026 14:39136,927694,388,945668,944,0001,999,0002,293,760
5Apr 3, 2026 14:39136,944695,146,250669,024,0002,000,0002,523,136
6Apr 3, 2026 14:39136,955696,406,455670,081,0001,000,0002,387,968
7Apr 3, 2026 14:39136,961698,017,640669,107,0002,000,0002,293,760
8Apr 3, 2026 14:39137,133699,044,881669,951,0001,999,0002,265,088
9Apr 3, 2026 14:39141,340717,549,959689,566,0002,998,0002,293,760