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 01:15zielajzielajScore: 3,621Success
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 01:153,60153,493,89627,495,0002,036,0002,383,872
2Oct 16, 2024 01:153,61757,972,60427,613,0002,045,0002,396,160
3Oct 16, 2024 01:153,61857,274,88126,599,0003,069,0002,514,944
4Oct 16, 2024 01:153,62058,540,90228,659,0001,023,0002,347,008
5Oct 16, 2024 01:153,62157,167,39127,643,0002,047,0002,519,040
6Oct 16, 2024 01:153,63957,895,56628,845,000994,0002,535,424
7Oct 16, 2024 01:153,64058,104,51527,859,0001,989,0002,412,544
8Oct 16, 2024 01:153,64154,640,36425,876,0003,980,0002,506,752
9Oct 16, 2024 01:153,67052,998,17327,084,0003,009,0002,347,008