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 7, 2023 20:20Franek KortaFranek KortaScore: 977,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2023 20:17973,5848,050,831,7787,983,388,29502,183,168
2Mar 7, 2023 20:17974,5488,056,523,4637,991,296,75002,183,168
3Mar 7, 2023 20:20976,8708,063,854,2008,010,334,14002,183,168
4Mar 7, 2023 20:20977,3058,102,483,4388,013,899,86702,187,264
5Mar 7, 2023 20:17978,0728,077,996,2308,020,191,05602,301,952
6Mar 7, 2023 20:20978,6428,086,105,7348,024,865,14102,187,264