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 25, 2026 08:58Victor MerckléVictor MerckléScore: 30,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 08:5930,248156,643,440147,133,0001,084,0002,117,632stderr
2Aug 25, 2026 08:5930,248157,029,699147,120,0001,100,0002,117,632stderr
3Aug 25, 2026 08:5930,255156,636,712147,168,0001,086,0002,117,632stderr
4Aug 25, 2026 08:5930,268156,720,882147,215,0001,100,0002,117,632stderr
5Aug 25, 2026 08:5930,271156,738,311147,233,0001,097,0002,117,632stderr
6Aug 25, 2026 08:5930,283156,788,290147,288,0001,100,0002,117,632stderr
7Aug 25, 2026 08:5930,285156,749,926147,302,0001,098,0002,117,632stderr
8Aug 25, 2026 08:5930,287157,485,358147,298,0001,111,0002,117,632stderr
9Aug 25, 2026 08:5930,298157,460,025147,361,0001,102,0002,117,632stderr