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 12, 2026 02:39Victor MerckléVictor MerckléScore: 64,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 02:4063,959322,515,866311,291,0002,110,0002,113,536
2Jun 12, 2026 02:4063,965322,594,512311,359,0002,071,0002,113,536
3Jun 12, 2026 02:4064,010322,781,692311,475,0002,178,0002,113,536
4Jun 12, 2026 02:4064,017322,847,176311,559,0002,125,0002,113,536
5Jun 12, 2026 02:4064,025322,866,209311,719,0002,008,0002,113,536
6Jun 12, 2026 02:4064,049324,432,690311,757,0002,085,0002,113,536
7Jun 12, 2026 02:4064,055323,020,232311,772,0002,102,0002,113,536
8Jun 12, 2026 02:4065,037327,815,935316,624,0002,060,0002,113,536
9Jun 12, 2026 02:4065,843331,771,117320,620,0002,013,0002,113,536