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 listDec 26, 2025 03:55Josu San MartinJosu San MartinScore: 12,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:5512,159130,189,95897,709,0001,994,0002,281,472
2Dec 26, 2025 03:5512,258127,509,55299,511,0001,005,0002,277,376
3Dec 26, 2025 03:5512,259125,700,617100,526,00002,527,232
4Dec 26, 2025 03:5512,261125,406,780100,540,00002,273,280
5Dec 26, 2025 03:5512,263124,515,14299,554,0001,005,0002,514,944
6Dec 26, 2025 03:5512,265127,626,72799,565,0001,005,0002,281,472
7Dec 26, 2025 03:5512,284129,174,19598,738,0001,994,0002,273,280
8Dec 26, 2025 03:5512,285128,504,755100,733,00002,392,064
9Dec 26, 2025 03:5512,285127,027,45698,742,0001,994,0002,273,280