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:51Karthik ReddyKarthik ReddyScore: 23,899Success
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:5223,861125,864,158115,853,0001,070,00020,480
2Oct 12, 2026 20:5223,867125,913,604115,852,0001,097,00020,480
3Oct 12, 2026 20:5223,878125,934,423115,932,0001,073,00020,480
4Oct 12, 2026 20:5223,892125,961,801116,003,0001,068,00020,480
5Oct 12, 2026 20:5223,899126,041,135115,967,0001,140,00020,480
6Oct 12, 2026 20:5223,906126,099,640116,069,0001,073,00020,480
7Oct 12, 2026 20:5223,911126,752,276116,025,0001,139,00020,480
8Oct 12, 2026 20:5223,941126,250,674116,176,0001,139,00020,480
9Oct 12, 2026 20:5223,951128,214,640116,279,0001,081,00020,480