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 listJun 29, 2025 15:17Aniruddha DebAniruddha DebScore: 360,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 15:17360,5411,791,093,6501,765,653,000999,0002,433,024
2Jun 29, 2025 15:17360,5421,795,334,2151,765,658,000999,0002,269,184
3Jun 29, 2025 15:17360,5611,786,103,0371,765,749,000999,0002,428,928
4Jun 29, 2025 15:17360,5791,790,901,3431,765,836,000999,0002,269,184
5Jun 29, 2025 15:17360,5961,797,409,5881,766,919,00002,269,184
6Jun 29, 2025 15:17360,5981,792,086,8491,765,929,000999,0002,269,184
7Jun 29, 2025 15:17360,6031,788,852,3421,765,956,000999,0002,269,184
8Jun 29, 2025 15:17360,6071,788,584,1991,765,973,000999,0002,420,736
9Jun 29, 2025 15:17360,6911,792,437,0591,766,386,000999,0002,531,328