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 listJul 1, 2026 23:21Victor MerckléVictor MerckléScore: 52,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 23:2152,282263,951,669254,178,0002,007,0002,117,632stderr
2Jul 1, 2026 23:2152,449264,882,410255,994,0001,007,0002,117,632stderr
3Jul 1, 2026 23:2152,627265,763,719256,872,0001,005,0002,117,632stderr
4Jul 1, 2026 23:2152,652265,984,502255,985,0002,013,0002,117,632stderr
5Jul 1, 2026 23:2152,665265,921,435256,048,0002,012,0002,117,632stderr
6Jul 1, 2026 23:2152,708265,957,861256,262,0002,010,0002,117,632stderr
7Jul 1, 2026 23:2152,736266,339,099256,392,0002,019,0002,117,632stderr
8Jul 1, 2026 23:2152,765266,427,921256,531,0002,020,0002,117,632stderr
9Jul 1, 2026 23:2153,737271,184,787261,268,0002,047,0002,117,632stderr