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 listMay 11, 2026 10:37wnwnScore: 98,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 10:3998,599492,478,356481,096,0002,040,0002,113,536
2May 11, 2026 10:3998,603493,544,960481,132,0002,025,0002,113,536
3May 11, 2026 10:3998,617491,913,312481,192,0002,036,0002,113,536
4May 11, 2026 10:3998,672492,797,702481,464,0002,031,0002,113,536
5May 11, 2026 10:3998,699494,261,728481,609,0002,020,0002,113,536
6May 11, 2026 10:3998,726492,969,813481,730,0002,032,0002,113,536
7May 11, 2026 10:3998,970493,736,677482,901,0002,056,0002,113,536
8May 11, 2026 10:3999,111494,470,353483,604,0002,043,0002,113,536
9May 11, 2026 10:3999,209494,942,630484,057,0002,071,0002,113,536