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 5, 2026 00:19Victor MerckléVictor MerckléScore: 61,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:1961,023308,070,950296,801,0002,214,0002,113,536
2Jun 5, 2026 00:1961,329309,642,413298,343,0002,172,0002,113,536
3Jun 5, 2026 00:1961,335309,610,666298,529,0002,015,0002,113,536
4Jun 5, 2026 00:1961,335309,667,195298,396,0002,149,0002,113,536
5Jun 5, 2026 00:1961,349310,363,044298,424,0002,187,0002,113,536
6Jun 5, 2026 00:1961,363309,778,515298,490,0002,192,0002,113,536
7Jun 5, 2026 00:1961,388309,959,870298,642,0002,164,0002,113,536
8Jun 5, 2026 00:1961,646311,157,232299,852,0002,214,0002,113,536
9Jun 5, 2026 00:1962,357314,683,544303,374,0002,177,0002,113,536