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 12, 2021 20:29Sergey StreminSergey StreminScore: 58,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 20:2957,250533,535,546469,448,60102,240,512
2Jun 12, 2021 20:2958,675545,321,973481,134,16302,248,704
3Jun 12, 2021 20:2959,236552,400,134485,733,13202,256,896