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:37Victor MerckléVictor MerckléScore: 51,169Success
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:3851,077257,879,854248,240,0002,039,0002,113,536
2Jun 18, 2026 01:3851,092257,956,166248,333,0002,022,0002,113,536
3Jun 18, 2026 01:3851,098258,026,981248,280,0002,103,0002,113,536
4Jun 18, 2026 01:3851,105258,191,164248,382,0002,036,0002,113,536
5Jun 18, 2026 01:3851,169258,304,847248,692,0002,040,0002,113,536
6Jun 18, 2026 01:3851,187258,495,785248,731,0002,089,0002,113,536
7Jun 18, 2026 01:3851,205259,284,198248,822,0002,087,0002,113,536
8Jun 18, 2026 01:3851,227258,656,330248,944,0002,072,0002,113,536
9Jun 18, 2026 01:3851,838261,699,424251,917,0002,091,0002,113,536