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 09:12Victor 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 09:12026,205,32001,480,000294,912Exit with code 1: seedlink_v=1 stat=1 size=1000000000 dev=34 ino=62173 link=/proc/self/fd/0:/mnt/hldata/data1522576167 link=/proc/self/fd/1:/mnt/hldata/got3625171759 p=a7b7fbbb,f6864ba1,49648d98,d6bdae5f,28335d97,f5853890,426eaae5,45d2cda0,e8a8807a,bd4...stderr