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 13, 2021 10:56Yurkov AlekseyYurkov AlekseyScore: 103,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 10:5686,373781,116,644708,260,98902,293,760
2Jun 13, 2021 10:56103,957925,382,571852,445,80202,281,472
3Jun 13, 2021 10:56117,1881,029,343,798960,942,73502,281,472