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 18, 2026 11:47Victor MerckléVictor MerckléScore: 53,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 11:4853,613270,406,890260,665,0002,043,0002,113,536
2Jun 18, 2026 11:4853,619270,395,614260,722,0002,012,0002,113,536
3Jun 18, 2026 11:4853,622271,227,641260,659,0002,089,0002,113,536
4Jun 18, 2026 11:4853,629270,432,346260,781,0002,005,0002,113,536
5Jun 18, 2026 11:4853,658270,498,489260,887,0002,042,0002,113,536
6Jun 18, 2026 11:4853,660270,605,349260,924,0002,014,0002,113,536
7Jun 18, 2026 11:4853,673270,506,038260,872,0002,127,0002,113,536
8Jun 18, 2026 11:4853,709270,866,463261,120,0002,055,0002,113,536
9Jun 18, 2026 11:4853,722270,912,294261,047,0002,194,0002,113,536