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 06:29limanjun99limanjun99Score: 98,112Success
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 06:2996,603818,306,867672,273,000119,870,0002,301,952
2Mar 18, 2026 06:2998,112827,651,524673,598,000130,922,0002,306,048
3Mar 18, 2026 06:2998,555842,177,254682,280,000125,867,0002,301,952