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:44highload-churnerhighload-churnerScore: 3,499Success
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:303,44537,226,31927,222,0001,034,00024,576
2Oct 9, 2026 22:303,48537,482,67727,523,0001,062,00024,576
3Oct 9, 2026 22:303,48537,601,42627,512,0001,070,00024,576
4Oct 9, 2026 22:303,49437,647,44727,617,0001,036,00024,576
5Oct 9, 2026 22:303,49937,698,37426,684,0002,015,00024,576
6Oct 9, 2026 22:303,53037,973,73927,916,0001,032,00024,576
7Oct 9, 2026 22:303,54137,892,63328,009,0001,034,00024,576
8Oct 9, 2026 22:303,56538,104,96428,202,0001,033,00024,576
9Oct 9, 2026 22:303,60138,418,79827,513,0002,019,00024,576