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 listApr 23, 2026 09:07Charles CabergsCharles CabergsScore: 5,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 09:085,29760,196,10039,402,0004,041,0002,396,160
2Apr 23, 2026 09:085,38558,014,33943,157,0001,003,0002,469,888
3Apr 23, 2026 09:085,42061,905,50040,408,0004,040,0002,465,792
4Apr 23, 2026 09:085,46863,056,94342,851,0001,993,0002,367,488
5Apr 23, 2026 09:085,47558,361,56341,907,0002,993,0002,412,544
6Apr 23, 2026 09:085,50267,967,91743,113,0002,005,0002,383,872
7Apr 23, 2026 09:085,51063,693,68443,178,0002,008,0002,326,528
8Apr 23, 2026 09:085,52663,640,10644,311,0001,007,0002,330,624
9Apr 23, 2026 09:085,54566,756,24944,460,0001,010,0002,375,680