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 listFeb 13, 2026 17:19olliecrowolliecrowScore: 115,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 17:19115,505596,900,434562,975,0002,999,0002,297,856
2Feb 13, 2026 17:19115,527593,390,160563,082,0003,000,0002,465,792
3Feb 13, 2026 17:19115,535593,014,002563,122,0003,000,0002,297,856
4Feb 13, 2026 17:19115,782594,555,313564,336,0002,996,0002,297,856
5Feb 13, 2026 17:19115,815594,486,773565,496,0001,998,0002,285,568
6Feb 13, 2026 17:19115,816598,277,815564,502,0002,997,0002,297,856
7Feb 13, 2026 17:19115,818591,911,011565,510,0001,998,0002,297,856
8Feb 13, 2026 17:19115,861596,670,591565,721,0001,999,0002,461,696
9Feb 13, 2026 17:19115,861597,550,138565,722,0001,999,0002,285,568