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 11:25Victor MerckléVictor MerckléScore: 41,443Success
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 11:2641,326210,802,736201,483,0001,018,0002,117,632stderr
2Aug 25, 2026 11:2641,356210,937,010201,618,0001,029,0002,117,632stderr
3Aug 25, 2026 11:2641,384211,793,866201,750,0001,033,0002,117,632stderr
4Aug 25, 2026 11:2641,417211,224,943201,857,0001,089,0002,117,632stderr
5Aug 25, 2026 11:2641,443212,371,193201,966,0001,105,0002,117,632stderr
6Aug 25, 2026 11:2641,448211,257,986201,998,0001,101,0002,117,632stderr
7Aug 25, 2026 11:2641,457211,409,144202,036,0001,105,0002,117,632stderr
8Aug 25, 2026 11:2641,458212,226,883202,051,0001,095,0002,117,632stderr
9Aug 25, 2026 11:2641,486212,277,112202,184,0001,101,0002,117,632stderr