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 13, 2026 04:35Karthik ReddyKarthik ReddyScore: 23,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 04:3923,112122,209,988112,170,0001,082,00020,480
2Oct 13, 2026 04:3923,119122,276,360112,180,0001,104,00020,480
3Oct 13, 2026 04:3923,132122,268,342112,192,0001,155,00020,480
4Oct 13, 2026 04:3923,192123,201,799112,544,0001,099,00020,480
5Oct 13, 2026 04:3923,210123,088,415112,635,0001,094,00020,480
6Oct 13, 2026 04:3923,212123,334,571112,635,0001,104,00020,480
7Oct 13, 2026 04:3923,213123,284,463112,668,0001,079,00020,480
8Oct 13, 2026 04:3923,227123,395,052112,692,0001,123,00020,480
9Oct 13, 2026 04:3923,265123,555,592112,886,0001,114,00020,480