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 13, 2026 04:12Victor MerckléVictor MerckléScore: 51,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 04:1651,336260,544,507249,536,0002,011,0002,129,920
2Jun 13, 2026 04:1651,372260,757,289248,715,0003,011,0002,129,920
3Jun 13, 2026 04:1651,372260,684,455248,702,0003,023,0002,174,976
4Jun 13, 2026 04:1651,386263,258,121248,756,0003,036,0002,174,976
5Jun 13, 2026 04:1651,396260,839,240248,832,0003,013,0002,129,920
6Jun 13, 2026 04:1651,413261,088,569248,893,0003,033,0002,129,920
7Jun 13, 2026 04:1651,448261,100,063250,086,0002,010,0002,129,920
8Jun 13, 2026 04:1651,455261,059,352249,102,0003,029,0002,150,400
9Jun 13, 2026 04:1652,068264,175,907253,123,0002,011,0002,134,016