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 listSep 3, 2026 04:29Josu San MartinJosu San MartinScore: 4,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:304,17744,377,93231,899,0002,359,0002,113,536
2Sep 3, 2026 04:304,19844,504,75532,034,0002,396,0002,113,536
3Sep 3, 2026 04:304,24945,617,57032,545,0002,302,0002,113,536
4Sep 3, 2026 04:304,25944,926,61432,647,0002,284,0002,113,536
5Sep 3, 2026 04:304,27545,773,33032,799,0002,262,0002,113,536
6Sep 3, 2026 04:304,28145,092,66932,765,0002,341,0002,113,536
7Sep 3, 2026 04:304,32045,515,84733,368,0002,059,0002,113,536
8Sep 3, 2026 04:304,33446,328,86933,192,0002,353,0002,113,536
9Sep 3, 2026 04:3021,477186,155,399169,670,0006,449,0002,117,632