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 listAug 21, 2024 13:58GabriellaGabriellaScore: 283,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 13:58283,6632,380,367,2702,326,039,85402,293,760
2Aug 21, 2024 13:58283,8942,391,382,6692,327,929,71002,297,856
3Aug 21, 2024 13:58307,9472,593,780,0202,525,165,90902,285,568