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 listMar 16, 2026 15:30Dominique GarmierDominique GarmierScore: 152,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 15:30150,523765,139,215735,564,0001,998,0002,465,792
2Mar 16, 2026 15:30150,718764,945,697736,518,0001,998,0002,265,088
3Mar 16, 2026 15:30151,483769,781,541741,270,000999,0002,461,696
4Mar 16, 2026 15:30151,914769,846,280743,380,000999,0002,265,088
5Mar 16, 2026 15:30152,638779,193,618745,930,0001,997,0002,273,280
6Mar 16, 2026 15:30153,718781,888,315752,216,0001,000,0002,265,088
7Mar 16, 2026 15:30153,915782,543,082754,183,00002,273,280
8Mar 16, 2026 15:30153,964784,292,114753,424,000999,0002,265,088
9Mar 16, 2026 15:30154,651785,388,520755,792,0001,999,0002,469,888