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 listJul 4, 2026 03:15zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 09:07Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 09:08043,153,02618,455,00016,721,00020,480No answer to stdout. Died or killed?stderr
2Jul 4, 2026 03:1624,205126,531,625116,524,0002,082,0002,121,728stderr
3Jul 4, 2026 03:1624,208126,901,013116,518,0002,106,0002,121,728stderr
4Jul 4, 2026 03:1624,211126,630,375116,557,0002,078,0002,121,728stderr
5Jul 4, 2026 03:1624,218126,643,174116,588,0002,085,0002,121,728stderr
6Jul 4, 2026 03:1624,220126,670,229116,604,0002,076,0002,121,728stderr
7Jul 4, 2026 03:1624,235126,682,362116,505,0002,249,0002,121,728stderr
8Jul 4, 2026 03:1624,276126,966,639116,847,0002,107,0002,121,728stderr
9Jul 4, 2026 03:1624,296127,063,586116,997,0002,055,0002,121,728stderr
10Jul 4, 2026 03:1624,306127,108,164116,990,0002,113,0002,121,728stderr