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 listApr 19, 2024 18:07Joad NacerJoad NacerScore: 96,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2024 18:0773,591674,891,856603,443,23702,285,568
2Apr 19, 2024 18:0796,316843,045,614789,788,29902,289,664
3Apr 19, 2024 18:07104,462928,674,764856,584,99302,301,952