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 27, 2021 19:47alex3dalex3dScore: 133,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 19:47121,8961,062,633,942999,551,14602,314,240
2Jun 27, 2021 19:47133,7661,162,063,4031,096,880,06302,297,856
3Jun 27, 2021 19:47141,7991,237,933,2881,162,748,18902,310,144