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 listOct 13, 2026 14:36highload-churnerhighload-churnerScore: 45,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 14:3845,660383,413,490372,402,0002,015,00032,768stderr
2Oct 13, 2026 14:3845,669383,400,178372,455,0002,034,00032,768stderr
3Oct 13, 2026 14:3845,714383,968,675372,832,0002,028,00028,672stderr
4Oct 13, 2026 14:3845,746384,305,389373,090,0002,028,00032,768stderr
5Oct 13, 2026 14:3845,770384,248,854373,288,0002,032,00032,768stderr
6Oct 13, 2026 14:3845,781384,452,607373,405,0002,005,00032,768stderr
7Oct 13, 2026 14:3845,782384,428,825373,401,0002,013,00032,768stderr
8Oct 13, 2026 14:3848,090403,285,941388,998,0005,343,00032,768stderr
9Oct 13, 2026 14:3848,958410,509,115396,222,0005,238,00032,768stderr