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 listMay 11, 2026 14:56Victor MerckléVictor MerckléScore: 95,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:5795,853478,660,402467,426,0002,254,0002,113,536
2May 11, 2026 14:5795,857480,955,677467,525,0002,178,0002,113,536
3May 11, 2026 14:5795,875478,631,615467,785,0002,007,0002,113,536
4May 11, 2026 14:5795,926479,406,260467,912,0002,130,0002,113,536
5May 11, 2026 14:5795,982481,252,602468,124,0002,189,0002,113,536
6May 11, 2026 14:5795,988480,822,568468,141,0002,204,0002,113,536
7May 11, 2026 14:5796,170480,720,144469,057,0002,180,0002,113,536
8May 11, 2026 14:5796,468483,363,629470,523,0002,172,0002,113,536
9May 11, 2026 14:5796,586484,405,630471,027,0002,248,0002,113,536