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 listMar 18, 2026 03:58limanjun99limanjun99Score: 108,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 03:5896,692821,689,480661,893,000130,978,0002,306,048
2Mar 18, 2026 03:58108,052916,303,040753,176,000132,854,0002,285,568
3Mar 18, 2026 03:58129,6521,088,246,120930,255,000132,893,0002,465,792