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 listMar 28, 2024 15:45Drew GarciaDrew GarciaScore: 111,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 15:4595,515849,874,206783,222,81702,277,376
2Mar 28, 2024 15:45111,095969,867,406910,975,56002,183,168
3Mar 28, 2024 15:45117,4321,022,886,003962,938,81202,273,280