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 13:42apuxbtapuxbtScore: 125,445Success
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 13:42105,333922,494,854863,729,94002,265,088
2Sep 28, 2023 13:42125,4451,093,456,4551,028,645,75402,269,184
3Sep 28, 2023 13:42161,5481,391,239,8621,324,695,89702,260,992