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 listJun 12, 2026 03:06Victor MerckléVictor MerckléScore: 89,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 03:0689,284446,634,748435,245,0002,248,0002,113,536
2Jun 12, 2026 03:0689,288446,671,685435,508,0002,007,0002,113,536
3Jun 12, 2026 03:0689,291446,627,267435,383,0002,145,0002,113,536
4Jun 12, 2026 03:0689,312454,507,831435,625,0002,008,0002,113,536
5Jun 12, 2026 03:0689,312446,710,532435,621,0002,008,0002,113,536
6Jun 12, 2026 03:0689,317446,798,947435,467,0002,190,0002,113,536
7Jun 12, 2026 03:0689,318446,772,568435,405,0002,256,0002,113,536
8Jun 12, 2026 03:0690,830454,247,466442,827,0002,244,0002,113,536
9Jun 12, 2026 03:0690,906454,531,001443,255,0002,185,0002,113,536