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 13, 2026 05:44Victor MerckléVictor MerckléScore: 63,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 05:4563,088317,964,301308,126,0001,007,0002,113,536
2May 13, 2026 05:4563,099317,907,495308,183,0001,005,0002,113,536
3May 13, 2026 05:4563,113316,462,618308,253,0001,005,0002,113,536
4May 13, 2026 05:4563,141316,658,853308,386,0001,005,0002,113,536
5May 13, 2026 05:4563,160316,605,882308,482,0001,006,0002,113,536
6May 13, 2026 05:4563,243318,889,841307,880,0002,015,0002,113,536
7May 13, 2026 05:4563,312318,560,960308,202,0002,027,0002,113,536
8May 13, 2026 05:4563,764319,586,818311,442,0001,004,0002,113,536
9May 13, 2026 05:4564,069321,384,896311,908,0002,034,0002,113,536