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 22:32mmalczakmmalczakScore: 145,376Success
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 22:32135,6951,170,794,0151,112,702,23102,301,952
2Nov 25, 2023 22:32145,3761,245,730,0371,192,084,92302,170,880
3Nov 25, 2023 22:32160,7591,373,664,2131,318,224,39702,174,976