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 01:28zielajzielajError
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 23:4100000Error: Exit with code 1: not a dynamic executable 2004318071 2290649223 2162313495 2290649223 0 4294967295 50000000 100000000 2162313495 2290649223 47185016 4924498 2162313495 2290649223 2814984 4924544 2224978540 2246367828 3347741 510993stderr
2Oct 14, 2024 01:284,90565,279,17432,178,0008,044,0002,285,568
3Oct 14, 2024 01:284,94163,647,05032,414,0008,103,0002,449,408
4Oct 14, 2024 01:285,30062,357,41530,319,00013,138,0002,469,888