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 28, 2026 08:51Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:51020,550,29601,823,000536,576Exit with code 1: fsprobe_v=1 pid=1 cwd=/root rl /proc/self/exe -> /main rl /proc/self/cwd -> /root rl /proc/self/root -> / rl /proc/self/fd/0 -> /mnt/hldata/data3182974796 rl /proc/self/fd/1 -> /mnt/hldata/got195324784 rl /proc/self/fd/2 -> pipe:[1096...stderr