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 4, 2026 19:40Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 19:400330,812,162312,641,0001,007,000339,968Exit with code 101: thread 'main' (1) panicked at main.rs:316:26: index out of bounds: the len is 10000 but the index is 10000 note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr
2May 4, 2026 19:40131,520659,432,250642,418,0002,030,0002,412,544