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 listJul 2, 2023 20:03Matt LangfordMatt LangfordScore: 97,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2023 20:0385,728758,017,503702,970,14102,293,760
2Jul 2, 2023 20:0397,097855,557,341796,193,23302,289,664
3Jul 2, 2023 20:03112,905986,388,220925,818,58902,293,760