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 listJun 29, 2021 19:39alex3dalex3dScore: 193,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 19:39187,2031,604,932,9871,535,067,99902,289,664
2Jun 29, 2021 19:39193,9511,654,579,8661,590,401,68102,277,376
3Jun 29, 2021 19:39205,2041,746,676,6681,682,675,69002,281,472