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 07:40Victor 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 07:41019,332,61401,242,000294,912Exit with code 1: probe_v=prefix_random_1 stat_ok=1 regular=1 st_size=1000000000 w0_ok=1 w0=1546532143 w1_ok=1 w1=1525670526 w2_ok=1 w2=2092132178 w3_ok=1 w3=585085490 w4_ok=1 w4=2856494940 w5_ok=1 w5=810068060 w6_ok=1 w6=1170505107 w7_ok=1 w7=15519205...stderr