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 20, 2026 02:01Victor MerckléVictor MerckléScore: 50,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 02:0250,510255,138,079245,361,0002,141,0002,113,536
2Jun 20, 2026 02:0250,516255,309,865245,429,0002,102,0002,113,536
3Jun 20, 2026 02:0250,556255,322,629245,606,0002,120,0002,113,536
4Jun 20, 2026 02:0250,558255,448,232245,603,0002,134,0002,113,536
5Jun 20, 2026 02:0250,564255,411,471245,643,0002,122,0002,113,536
6Jun 20, 2026 02:0250,568255,248,729245,668,0002,117,0002,113,536
7Jun 20, 2026 02:0251,005257,696,551247,793,0002,136,0002,113,536
8Jun 20, 2026 02:0251,041258,088,761247,948,0002,154,0002,113,536
9Jun 20, 2026 02:0251,275258,641,176249,185,0002,063,0002,113,536