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 13, 2026 02:53Victor MerckléVictor MerckléScore: 51,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 02:5351,075257,906,263248,262,0002,010,0002,113,536
2Jun 13, 2026 02:5351,086257,830,124248,278,0002,046,0002,113,536
3Jun 13, 2026 02:5351,095258,033,764248,314,0002,053,0002,113,536
4Jun 13, 2026 02:5351,099257,907,665248,377,0002,012,0002,113,536
5Jun 13, 2026 02:5351,103258,133,729248,199,0002,206,0002,113,536
6Jun 13, 2026 02:5351,116258,481,356248,326,0002,146,0002,113,536
7Jun 13, 2026 02:5351,128258,417,116248,356,0002,173,0002,113,536
8Jun 13, 2026 02:5351,213258,639,117248,929,0002,015,0002,113,536
9Jun 13, 2026 02:5351,703261,392,877251,261,0002,086,0002,113,536