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 18:38Victor MerckléVictor MerckléScore: 53,474Success
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 18:3953,280268,483,082259,033,0002,039,0002,113,536
2Jun 19, 2026 18:3953,317268,870,329259,239,0002,017,0002,113,536
3Jun 19, 2026 18:3953,334269,100,957259,250,0002,087,0002,113,536
4Jun 19, 2026 18:3953,388269,641,614259,602,0002,003,0002,113,536
5Jun 19, 2026 18:3953,474269,683,588260,009,0002,016,0002,113,536
6Jun 19, 2026 18:3953,527270,257,589260,235,0002,050,0002,113,536
7Jun 19, 2026 18:3953,581270,142,709260,491,0002,060,0002,113,536
8Jun 19, 2026 18:3953,661270,601,380260,876,0002,067,0002,113,536
9Jun 19, 2026 18:3953,970272,431,927262,425,0002,030,0002,113,536