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:56mmalczakmmalczakScore: 999,065Success
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:56995,5968,230,704,8128,163,889,66002,174,976
2Nov 25, 2023 19:56999,0658,261,707,4468,192,332,69902,179,072
3Nov 25, 2023 19:56999,7168,255,909,1368,197,672,87302,183,168