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 listMay 17, 2024 19:37Joad NacerJoad NacerScore: 49,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2024 19:3747,994454,494,128393,546,95502,207,744
2May 17, 2024 19:3749,333469,469,006404,534,66902,269,184
3May 17, 2024 19:3751,511477,274,073422,388,85902,256,896