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:33Victor MerckléVictor MerckléScore: 95,711Success
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:3595,609479,135,025466,256,0002,231,0002,113,536
2May 11, 2026 14:3595,630479,145,684466,582,0002,005,0002,113,536
3May 11, 2026 14:3595,647480,531,662466,499,0002,176,0002,113,536
4May 11, 2026 14:3595,666480,194,842466,748,0002,020,0002,113,536
5May 11, 2026 14:3595,711477,892,241466,768,0002,217,0002,113,536
6May 11, 2026 14:3595,728479,189,803466,861,0002,210,0002,113,536
7May 11, 2026 14:3595,757480,354,023467,037,0002,174,0002,113,536
8May 11, 2026 14:3596,180482,266,884469,058,0002,227,0002,113,536
9May 11, 2026 14:3596,569486,970,626470,980,0002,211,0002,113,536