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 22:03highload-churnerhighload-churnerScore: 3,407Success
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:583,29636,067,22326,004,0001,031,00024,576
2Oct 9, 2026 22:583,32936,265,55826,266,0001,033,00024,576
3Oct 9, 2026 22:583,35746,009,24526,504,0001,025,00024,576
4Oct 9, 2026 22:583,39037,388,60126,768,0001,030,00024,576
5Oct 9, 2026 22:583,40747,580,63226,917,0001,028,00024,576
6Oct 9, 2026 22:583,41337,585,63026,959,0001,033,00024,576
7Oct 9, 2026 22:5826,460226,252,474215,972,0001,004,00024,576
8Oct 9, 2026 22:5827,407233,834,358223,736,0001,005,00024,576
9Oct 9, 2026 22:5828,270241,455,513229,807,0002,009,00020,480