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 15:56Victor MerckléVictor MerckléScore: 27,264Success
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 15:5727,191141,602,657132,208,0001,029,0002,117,632stderr
2Aug 25, 2026 15:5727,192141,596,259132,227,0001,018,0002,117,632stderr
3Aug 25, 2026 15:5727,195141,651,566132,239,0001,019,0002,117,632stderr
4Aug 25, 2026 15:5727,247141,872,797132,407,0001,104,0002,117,632stderr
5Aug 25, 2026 15:5727,264142,004,819132,511,0001,085,0002,117,632stderr
6Aug 25, 2026 15:5727,265142,054,863132,502,0001,098,0002,117,632stderr
7Aug 25, 2026 15:5727,269141,980,672132,527,0001,093,0002,117,632stderr
8Aug 25, 2026 15:5727,276142,042,872132,539,0001,115,0002,117,632stderr
9Aug 25, 2026 15:5727,302142,864,660132,599,0001,185,0002,117,632stderr