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:05Victor 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:05020,091,14501,760,000286,720Exit with code 1: struct_v=1 stat=1 size=1000000000 seq=0:55325aad;1:9bd316c2;2:e920dd66;3:a4b3ada9;4:5d639cae;5:26e05139;6:3bb30b3a;7:48f2ed13;8:d65c5582;9:dd9c95e4;10:83f38d16;11:9076b6eb;12:15241600;13:df8055de;14:a48d96d2;15:cb29257d;16:fdef057f;17...stderr