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 18:56Victor MerckléVictor MerckléScore: 30,134Success
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 18:5729,839154,418,322144,045,0002,169,0002,117,632stderr
2Aug 24, 2026 18:5729,897154,840,802144,472,0002,025,0002,117,632stderr
3Aug 24, 2026 18:5729,988155,337,487144,808,0002,137,0002,117,632stderr
4Aug 24, 2026 18:5730,006155,504,567144,907,0002,127,0002,117,632stderr
5Aug 24, 2026 18:5730,134156,102,517145,506,0002,152,0002,117,632stderr
6Aug 24, 2026 18:5730,181156,294,018145,728,0002,163,0002,117,632stderr
7Aug 24, 2026 18:5730,256156,712,473146,242,0002,014,0002,117,632stderr
8Aug 24, 2026 18:5730,348157,140,068146,546,0002,162,0002,117,632stderr
9Aug 24, 2026 18:5730,350157,199,857146,601,0002,118,0002,117,632stderr