Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listOct 9, 2026 08:12Karthik ReddyKarthik ReddyScore: 2,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:192,53329,776,10820,776,000020,480
2Oct 9, 2026 08:192,53529,670,33820,788,000020,480
3Oct 9, 2026 08:192,53529,758,07620,795,000020,480
4Oct 9, 2026 08:192,53929,716,00920,821,000020,480
5Oct 9, 2026 08:192,54229,754,78820,849,000020,480
6Oct 9, 2026 08:192,54429,747,75920,861,000020,480
7Oct 9, 2026 08:192,55139,907,91820,919,000020,480
8Oct 9, 2026 08:192,55529,970,57519,952,0001,007,00020,480
9Oct 9, 2026 08:192,58239,772,15821,180,000020,480