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:51apuxbtapuxbtError
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:5000000Error: No answer to stdout. Died or killed?stderr
2Sep 28, 2023 14:5146,026432,438,266377,416,83102,301,952
3Sep 28, 2023 14:5146,666448,733,241382,657,79302,277,376
4Sep 28, 2023 14:5147,571454,241,103390,084,94702,289,664