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 04:45Victor MerckléVictor MerckléScore: 27,998Success
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 04:4627,858144,992,077135,498,0001,009,0002,117,632stderr
2Aug 25, 2026 04:4627,874144,991,493134,478,0002,106,0002,117,632stderr
3Aug 25, 2026 04:4627,898145,061,690135,692,0001,009,0002,117,632stderr
4Aug 25, 2026 04:4627,992145,603,047135,118,0002,045,0002,117,632stderr
5Aug 25, 2026 04:4627,998145,478,014136,185,0001,010,0002,117,632stderr
6Aug 25, 2026 04:4628,004145,636,256136,213,0001,010,0002,117,632stderr
7Aug 25, 2026 04:4628,063145,930,212135,469,0002,040,0002,117,632stderr
8Aug 25, 2026 04:4628,081146,041,107135,591,0002,008,0002,117,632stderr
9Aug 25, 2026 04:4628,284146,980,778137,581,0001,012,0002,117,632stderr