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 16, 2024 23:32zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 23:2800000Error: Exit with code 1: not a dynamic executable 1600000 830246 858429 2021627636 2021627636 3000000 2018627636 2024627636 2018627636 2024627636 50000000 100000000 2018627636 2024627636 49847769 137598stderr
2Oct 16, 2024 23:323,47056,394,65226,421,0002,032,0002,453,504
3Oct 16, 2024 23:323,48051,408,65327,517,0001,019,0002,363,392
4Oct 16, 2024 23:323,48457,999,64828,565,00002,334,720