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 20, 2026 01:42Victor MerckléVictor MerckléScore: 50,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 01:4349,835251,812,484242,161,0002,031,0002,113,536
2Jun 20, 2026 01:4349,872251,961,889242,339,0002,038,0002,113,536
3Jun 20, 2026 01:4349,878252,044,674243,400,0001,007,0002,113,536
4Jun 20, 2026 01:4350,201253,664,359243,956,0002,033,0002,113,536
5Jun 20, 2026 01:4350,268253,926,800244,293,0002,021,0002,113,536
6Jun 20, 2026 01:4350,323254,255,628244,582,0002,005,0002,113,536
7Jun 20, 2026 01:4350,373254,426,951244,820,0002,011,0002,113,536
8Jun 20, 2026 01:4350,403254,597,915244,971,0002,007,0002,113,536
9Jun 20, 2026 01:4350,696257,143,106246,401,0002,013,0002,113,536