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 listJul 10, 2026 00:29Victor MerckléVictor MerckléScore: 34,273Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:3033,922174,054,445164,143,0002,078,0002,117,632stderr
2Jul 10, 2026 00:3034,216175,495,803165,576,0002,085,0002,117,632stderr
3Jul 10, 2026 00:3034,255175,996,363165,767,0002,086,0002,117,632stderr
4Jul 10, 2026 00:3034,258175,746,435165,721,0002,144,0002,117,632stderr
5Jul 10, 2026 00:3034,273175,913,314165,807,0002,131,0002,117,632stderr
6Jul 10, 2026 00:3034,282175,861,797165,884,0002,098,0002,117,632stderr
7Jul 10, 2026 00:3034,383176,488,302166,410,0002,070,0002,117,632stderr
8Jul 10, 2026 00:3034,460176,936,074166,732,0002,125,0002,117,632stderr
9Jul 10, 2026 00:3034,654177,884,814167,601,0002,204,0002,117,632stderr