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:49alex3dalex3dScore: 172,135Success
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:49154,0001,334,315,3941,262,803,29102,277,376
2Jun 29, 2021 19:49172,1351,473,779,5491,411,510,61602,289,664
3Jun 29, 2021 19:49180,6581,539,475,7021,481,393,98302,285,568