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 21:56highload-churnerhighload-churnerScore: 3,820Success
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 22:533,70339,478,10529,338,0001,031,00024,576
2Oct 9, 2026 22:533,71839,426,06929,462,0001,032,00024,576
3Oct 9, 2026 22:533,74839,713,23129,673,0001,065,00024,576
4Oct 9, 2026 22:533,79740,100,89430,100,0001,036,00024,576
5Oct 9, 2026 22:533,82040,276,47830,297,0001,034,00024,576
6Oct 9, 2026 22:533,83140,381,32130,386,0001,030,00024,576
7Oct 9, 2026 22:533,83240,473,29330,391,0001,032,00024,576
8Oct 9, 2026 22:533,84540,478,09930,501,0001,030,00024,576
9Oct 9, 2026 22:5326,266224,334,759214,382,0001,006,00024,576