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 listNov 25, 2023 19:58mmalczakmmalczakScore: 886,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2023 19:58877,8047,252,369,0897,197,993,88502,179,072
2Nov 25, 2023 19:58886,7067,328,295,2997,270,989,03402,183,168
3Nov 25, 2023 19:58890,5737,360,764,1257,302,695,93102,179,072