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 24, 2026 16:16Victor MerckléVictor MerckléScore: 29,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 16:2029,281151,901,865142,468,0001,010,0002,117,632stderr
2Aug 24, 2026 16:2029,307151,979,305142,596,0001,010,0002,117,632stderr
3Aug 24, 2026 16:2029,331152,406,473141,718,0002,007,0002,117,632stderr
4Aug 24, 2026 16:2029,345152,608,860142,783,0001,009,0002,117,632stderr
5Aug 24, 2026 16:2029,417152,635,642142,122,0002,023,0002,117,632stderr
6Aug 24, 2026 16:2029,433152,653,348143,215,0001,009,0002,117,632stderr
7Aug 24, 2026 16:2029,504153,037,153142,555,0002,017,0002,117,632stderr
8Aug 24, 2026 16:2029,602153,416,710144,040,0001,010,0002,117,632stderr
9Aug 24, 2026 16:2029,877154,734,792145,389,0001,010,0002,117,632stderr