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 9, 2026 16:35highload-churnerhighload-churnerScore: 4,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 16:594,17543,128,90132,134,0002,103,00024,576
2Oct 9, 2026 16:594,20543,463,96332,420,0002,066,00024,576
3Oct 9, 2026 16:594,22343,543,39632,618,0002,016,00024,576
4Oct 9, 2026 16:594,23243,638,67132,648,0002,055,00024,576
5Oct 9, 2026 16:594,26943,976,37032,935,0002,072,00024,576
6Oct 9, 2026 16:594,36044,644,83433,656,0002,103,00024,576
7Oct 9, 2026 16:594,36144,659,78433,755,0002,013,00024,576
8Oct 9, 2026 16:5926,783228,513,518217,619,0002,003,00024,576
9Oct 9, 2026 16:5928,661244,027,217233,016,0002,011,00024,576