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 21:14Victor MerckléVictor MerckléScore: 49,433Success
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 21:1549,352249,536,698239,762,0002,065,0002,113,536
2Jun 19, 2026 21:1549,366249,623,804239,768,0002,127,0002,113,536
3Jun 19, 2026 21:1549,404249,695,331239,992,0002,091,0002,113,536
4Jun 19, 2026 21:1549,416249,756,670240,121,0002,019,0002,113,536
5Jun 19, 2026 21:1549,433249,640,170240,182,0002,044,0002,113,536
6Jun 19, 2026 21:1549,475250,032,011240,361,0002,067,0002,113,536
7Jun 19, 2026 21:1549,514250,111,749240,542,0002,080,0002,113,536
8Jun 19, 2026 21:1549,527250,306,813240,612,0002,073,0002,113,536
9Jun 19, 2026 21:1549,984252,586,327242,884,0002,038,0002,113,536