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 05:47Victor MerckléVictor MerckléScore: 29,557Success
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 05:4829,472152,752,320143,405,0001,010,0002,117,632stderr
2Aug 25, 2026 05:4829,521152,846,924142,638,0002,015,0002,117,632stderr
3Aug 25, 2026 05:4829,546153,220,880143,768,0001,008,0002,117,632stderr
4Aug 25, 2026 05:4829,549153,200,296143,783,0001,009,0002,117,632stderr
5Aug 25, 2026 05:4829,557153,229,647143,821,0001,010,0002,117,632stderr
6Aug 25, 2026 05:4829,593153,332,744143,999,0001,009,0002,117,632stderr
7Aug 25, 2026 05:4829,646153,756,877144,260,0001,009,0002,117,632stderr
8Aug 25, 2026 05:4829,666153,708,181143,351,0002,015,0002,117,632stderr
9Aug 25, 2026 05:4829,885154,854,292145,431,0001,009,0002,117,632stderr