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 18, 2026 19:40Victor MerckléVictor MerckléScore: 53,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 19:4053,639270,955,354260,802,0002,030,0002,113,536
2Jun 18, 2026 19:4053,641270,320,617260,757,0002,084,0002,113,536
3Jun 18, 2026 19:4053,666270,589,741260,912,0002,052,0002,113,536
4Jun 18, 2026 19:4053,674270,615,062260,882,0002,123,0002,113,536
5Jun 18, 2026 19:4053,687270,650,567260,992,0002,076,0002,113,536
6Jun 18, 2026 19:4053,697270,566,391260,931,0002,188,0002,113,536
7Jun 18, 2026 19:4053,707271,211,954261,023,0002,145,0002,113,536
8Jun 18, 2026 19:4053,747270,762,680261,206,0002,159,0002,113,536
9Jun 18, 2026 19:4053,859271,548,817261,830,0002,083,0002,113,536