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:03Victor 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:0302,037,550,4422,012,868,0001,998,000217,088Exit with code 1: probe_v=compact2 stat=1 regular=1 size=1000000000 map_ok=1 first32=2725299220,3909428304,4100800356,2910173897,2400703128,850040280,3852642490,2259262094,1841150891,2927143927,2195028235,1272803498,4177711498,900602409,2393953700,3260...stderr