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 listOct 12, 2026 20:43Karthik ReddyKarthik ReddyScore: 23,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:4323,931126,133,331116,177,0001,085,00020,480
2Oct 12, 2026 20:4323,946126,224,296116,277,0001,059,00020,480
3Oct 12, 2026 20:4323,949126,290,262116,257,0001,094,00020,480
4Oct 12, 2026 20:4323,955126,290,015116,321,0001,063,00020,480
5Oct 12, 2026 20:4323,955126,283,698116,315,0001,066,00020,480
6Oct 12, 2026 20:4323,956126,351,367116,318,0001,068,00020,480
7Oct 12, 2026 20:4323,961126,327,855116,318,0001,092,00020,480
8Oct 12, 2026 20:4323,983126,484,942116,406,0001,111,00020,480
9Oct 12, 2026 20:4324,008126,617,023116,558,0001,084,00020,480