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 listAug 24, 2026 20:58Victor MerckléVictor MerckléScore: 28,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:5928,364147,425,611137,977,0001,011,0002,117,632stderr
2Aug 24, 2026 20:5928,383147,437,208137,063,0002,015,0002,117,632stderr
3Aug 24, 2026 20:5928,411147,602,589137,185,0002,032,0002,117,632stderr
4Aug 24, 2026 20:5928,439147,734,814138,342,0001,010,0002,117,632stderr
5Aug 24, 2026 20:5928,576148,425,951139,017,0001,009,0002,117,632stderr
6Aug 24, 2026 20:5928,600148,587,021138,100,0002,043,0002,117,632stderr
7Aug 24, 2026 20:5928,688149,010,599139,565,0001,009,0002,117,632stderr
8Aug 24, 2026 20:5928,840149,783,501140,308,0001,011,0002,117,632stderr
9Aug 24, 2026 20:5928,906150,017,098139,636,0002,005,0002,117,632stderr