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 listSep 5, 2022 11:23Eugene ZhydzetskiEugene ZhydzetskiScore: 37,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2022 11:2336,913359,053,738302,682,95002,289,664
2Sep 5, 2022 11:2337,088359,370,630304,121,42802,289,664
3Sep 5, 2022 11:2337,192371,285,904304,976,24702,293,760