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 listOct 31, 2021 10:26Ilya AniskovetsIlya AniskovetsScore: 31,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2021 10:2631,282314,313,297256,513,36302,256,896
2Oct 31, 2021 10:2631,532319,637,672258,563,35002,252,800
3Oct 31, 2021 10:2631,747334,441,598260,327,85802,244,608