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 listFeb 7, 2026 21:05Josu San MartinJosu San MartinScore: 3,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 21:053,49555,994,64127,640,0001,023,0002,326,528
2Feb 7, 2026 21:053,49959,341,75526,640,0002,049,0002,469,888
3Feb 7, 2026 21:053,52055,349,63925,875,0002,985,0002,277,376
4Feb 7, 2026 21:053,54054,157,61628,026,0001,000,0002,318,336
5Feb 7, 2026 21:0511,275119,848,47789,444,0003,014,0002,310,144
6Feb 7, 2026 21:0511,318117,624,89388,820,0003,991,0002,375,680