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:55Victor MerckléVictor MerckléScore: 28,029Success
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:5627,953146,507,826135,951,0001,021,0002,117,632stderr
2Aug 25, 2026 15:5627,968145,429,698136,030,0001,018,0002,117,632stderr
3Aug 25, 2026 15:5627,979145,460,732135,997,0001,103,0002,117,632stderr
4Aug 25, 2026 15:5628,008145,633,610136,159,0001,085,0002,117,632stderr
5Aug 25, 2026 15:5628,029145,710,169136,244,0001,100,0002,117,632stderr
6Aug 25, 2026 15:5628,037146,070,603136,240,0001,146,0002,117,632stderr
7Aug 25, 2026 15:5628,045145,937,404136,263,0001,158,0002,117,632stderr
8Aug 25, 2026 15:5628,051145,856,214136,371,0001,083,0002,117,632stderr
9Aug 25, 2026 15:5628,054145,856,224136,339,0001,128,0002,117,632stderr