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 14, 2024 00:22zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:2200000Error: Exit with code 1: not a dynamic executable 0 0 2124932680 2182198910 50894 1341995 2123286704 2130922200 0 143255 2123286704 2130922200 50894 143255 2125490322 2126508388 13518 24486stderr
2Oct 14, 2024 00:226,01472,028,53835,226,00014,090,0002,465,792
3Oct 14, 2024 00:226,04978,668,47634,419,00015,185,0002,306,048
4Oct 14, 2024 00:226,34075,218,50335,990,00015,995,0002,334,720