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 listMay 14, 2026 16:49Josu San MartinJosu San MartinScore: 40,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 16:5739,125329,199,680318,661,0002,164,0002,138,112
2May 14, 2026 16:5739,680335,148,200323,230,0002,149,0002,138,112
3May 14, 2026 16:5739,996336,565,512325,708,0002,262,0002,138,112
4May 14, 2026 16:5740,034335,643,335326,100,0002,185,0002,138,112
5May 14, 2026 16:5740,188338,140,184327,500,0002,048,0002,183,168
6May 14, 2026 16:5740,528339,716,122330,294,0002,043,0002,138,112
7May 14, 2026 16:5740,566342,374,605330,550,0002,099,0002,138,112
8May 14, 2026 16:5740,920353,892,658333,284,0002,268,0002,138,112
9May 14, 2026 16:5741,070346,539,759334,684,0002,092,0002,138,112