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:37Karthik ReddyKarthik ReddyScore: 24,373Success
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:3724,305128,006,908118,014,0001,081,00020,480
2Oct 12, 2026 20:3724,308128,116,697118,067,0001,047,00020,480
3Oct 12, 2026 20:3724,312128,072,368118,073,0001,059,00020,480
4Oct 12, 2026 20:3724,315128,023,885118,096,0001,051,00020,480
5Oct 12, 2026 20:3724,373128,337,178118,263,0001,169,00020,480
6Oct 12, 2026 20:3724,426128,613,176118,624,0001,064,00020,480
7Oct 12, 2026 20:3724,455128,785,740118,760,0001,070,00020,480
8Oct 12, 2026 20:3724,506129,105,214118,971,0001,110,00020,480
9Oct 12, 2026 20:3724,521129,037,511119,100,0001,054,00020,480