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 listSep 28, 2023 14:23apuxbtapuxbtScore: 73,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 14:2372,270654,841,894592,614,01402,269,184
2Sep 28, 2023 14:2373,501673,155,856602,707,87902,273,280
3Sep 28, 2023 14:2374,438666,013,582610,390,24702,269,184