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 listOct 17, 2024 00:50zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2024 00:5000000Error: Exit with code 1: not a dynamic executable 67760 31967 35165 2167120921 757584 375486 382888 2164986362 2164986362 3000000 2161986362 2167986362 2161986362 2167986362 50000000 100000000 2161986362 2167986362 49826003 143146stderr
2Oct 17, 2024 01:0100000Error: Exit with code 1: not a dynamic executable 67760 32127 35511 2151088848 757584 377741 385086 2136812469 2136812469 3000000 2133812469 2139812469 2133812469 2139812469 50000000 100000000 2133812469 2139812469 49769805 148046stderr