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 19, 2026 11:54Victor MerckléVictor MerckléScore: 50,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 11:5549,995252,672,229242,924,0002,056,0002,113,536
2Jun 19, 2026 11:5550,006253,026,798243,011,0002,019,0002,113,536
3Jun 19, 2026 11:5550,032252,911,639243,091,0002,066,0002,113,536
4Jun 19, 2026 11:5550,095253,121,510243,406,0002,063,0002,113,536
5Jun 19, 2026 11:5550,125253,203,363243,542,0002,071,0002,113,536
6Jun 19, 2026 11:5550,148253,113,789243,598,0002,129,0002,113,536
7Jun 19, 2026 11:5550,214253,783,472243,946,0002,107,0002,113,536
8Jun 19, 2026 11:5550,289254,014,084244,341,0002,078,0002,113,536
9Jun 19, 2026 11:5550,673255,970,158246,268,0002,033,0002,113,536