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:37Victor 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:37019,892,1241,099,0001,099,000294,912Exit with code 1: mtprobe_v=1 stat=1 regular=1 size=1000000000 n=624 r00=b6080915,5554c2dd,887d3857,675e76b3,778f26c7,71e628c8,3113fb11,21262115,14a0b99f,8dc04e5b,cc990858,96c519a5,ae22cbb0,bccc5f55,59dd37cf,d225ab26,219d4748,85ab103b,8d1a1dce,23383b0f...stderr