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 15:41Karthik ReddyKarthik ReddyScore: 2,540Success
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 16:212,53629,591,80320,800,000020,480
2Oct 9, 2026 16:212,53729,562,35620,807,000020,480
3Oct 9, 2026 16:212,53729,559,36020,809,000020,480
4Oct 9, 2026 16:212,53829,445,42220,816,000020,480
5Oct 9, 2026 16:212,54029,629,08520,831,000020,480
6Oct 9, 2026 16:212,54029,496,36320,833,000020,480
7Oct 9, 2026 16:212,55529,674,98519,945,0001,009,00020,480
8Oct 9, 2026 16:212,55529,465,41320,956,000020,480
9Oct 9, 2026 16:212,67940,009,30520,962,0001,013,00020,480