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 01:23Victor MerckléVictor MerckléScore: 55,814Success
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 01:2355,729280,683,930271,057,0002,016,0002,113,536
2Jun 18, 2026 01:2355,732281,092,137270,960,0002,130,0002,113,536
3Jun 18, 2026 01:2355,766280,897,912271,164,0002,094,0002,113,536
4Jun 18, 2026 01:2355,809281,141,354271,292,0002,173,0002,113,536
5Jun 18, 2026 01:2355,814281,147,021271,354,0002,136,0002,113,536
6Jun 18, 2026 01:2357,015287,666,413277,317,0002,057,0002,113,536
7Jun 18, 2026 01:2357,207289,257,161278,219,0002,100,0002,113,536
8Jun 18, 2026 01:2357,366288,758,742279,001,0002,097,0002,113,536
9Jun 18, 2026 01:2357,661291,672,052280,402,0002,137,0002,113,536