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 04:01Victor MerckléVictor MerckléScore: 50,789Success
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 04:0250,702255,831,223246,412,0002,032,0002,113,536
2Jun 19, 2026 04:0250,706256,451,878246,450,0002,010,0002,113,536
3Jun 19, 2026 04:0250,747256,384,444246,621,0002,043,0002,113,536
4Jun 19, 2026 04:0250,751256,366,879246,637,0002,044,0002,113,536
5Jun 19, 2026 04:0250,789256,475,168246,836,0002,031,0002,113,536
6Jun 19, 2026 04:0250,791257,559,519246,813,0002,066,0002,113,536
7Jun 19, 2026 04:0250,805256,496,194246,868,0002,080,0002,113,536
8Jun 19, 2026 04:0250,843256,758,402247,062,0002,069,0002,113,536
9Jun 19, 2026 04:0250,871256,838,233247,228,0002,042,0002,113,536