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:26Victor 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:27015,208,46301,471,000299,008Exit with code 1: sparse_v=1 stat=1 regular=1 size=1000000000 dev=34 ino=59878 blksize=2097152 blocks=1953792 samples=0:5195a94c:3917:4;1:c84041c6:716:4;2:7e00065f:604:4;3:f11ce8d9:587:4;4:e982ace2:582:4;5:9f46d3f3:586:4;6:e5ac83a9:583:4;7:8f146e76:587...stderr