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 listApr 22, 2026 12:21BenBenError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 12:2101,000,997,035976,779,0002,999,0002,473,984expected "560380284863 ", got "2034536383 "
2Apr 22, 2026 12:210986,422,226963,511,0002,998,0002,469,888expected "560373162029 ", got "2027413549 "
3Apr 22, 2026 12:210983,368,252961,664,0003,998,0002,482,176expected "560380212219 ", got "2034463739 "