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 30, 2026 13:45Victor 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 30, 2026 13:4502,987,697,0042,965,461,000999,000344,064Exit with code 1: probe_v=combo3 stat=1 regular=1 size=1000000000 dev=34 ino=83242 link_0=/mnt/hldata/data332449496 link_1=/mnt/hldata/got2462648711 map_ok=1 pos=0:219fea99;1:081633c6;2:9c2a8a5c;3:639c02e8;4:b4a80ec1;5:3280c57a;6:24c52c51;7:62efba36;8:...stderr