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 4, 2026 23:38Victor MerckléVictor MerckléScore: 63,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 23:3862,950316,073,834306,447,0002,011,0002,113,536
2Jun 4, 2026 23:3862,972316,271,445306,545,0002,019,0002,113,536
3Jun 4, 2026 23:3863,060316,613,122307,993,0001,005,0002,113,536
4Jun 4, 2026 23:3863,072316,637,004308,047,0001,006,0002,113,536
5Jun 4, 2026 23:3863,086316,659,059308,119,0001,007,0002,113,536
6Jun 4, 2026 23:3863,140317,048,301308,385,0001,005,0002,113,536
7Jun 4, 2026 23:3863,184317,452,637307,596,0002,006,0002,113,536
8Jun 4, 2026 23:3863,235321,432,261307,709,0002,146,0002,113,536
9Jun 4, 2026 23:3864,385323,115,144314,484,0001,005,0002,113,536