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 03:38highload-churnerhighload-churnerScore: 27,141Success
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 03:393,55039,682,10228,082,0001,029,0002,113,536
2Oct 9, 2026 03:3926,935231,533,910219,865,0001,004,0002,113,536
3Oct 9, 2026 03:3927,003231,984,205220,427,0001,004,0002,117,632
4Oct 9, 2026 03:3927,019232,153,283220,552,0001,004,0002,117,632
5Oct 9, 2026 03:3927,141233,272,708221,553,0001,004,0002,117,632
6Oct 9, 2026 03:3927,469235,843,879224,242,0001,005,0002,117,632
7Oct 9, 2026 03:3927,596236,912,585225,286,0001,003,0002,117,632
8Oct 9, 2026 03:3928,829248,299,719235,399,0001,004,0002,117,632
9Oct 9, 2026 03:3928,830247,059,964234,393,0002,016,0002,113,536