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 19:34Karthik ReddyKarthik ReddyScore: 23,898Success
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 19:3523,863127,300,192115,858,0001,075,00020,480
2Oct 12, 2026 19:3523,879125,932,281115,943,0001,068,00020,480
3Oct 12, 2026 19:3523,889126,024,718115,984,0001,073,00020,480
4Oct 12, 2026 19:3523,892126,006,748116,007,0001,067,00020,480
5Oct 12, 2026 19:3523,898126,102,583116,048,0001,053,00020,480
6Oct 12, 2026 19:3523,899126,053,604116,037,0001,072,00020,480
7Oct 12, 2026 19:3523,948126,246,572116,343,0001,005,00020,480
8Oct 12, 2026 19:3523,954126,401,929116,292,0001,083,00020,480
9Oct 12, 2026 19:3523,991127,154,328116,457,0001,103,00020,480