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 15, 2026 01:49highload-churnerhighload-churnerScore: 2,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 01:502,48729,434,41120,401,000020,480
2Oct 15, 2026 01:502,49030,904,74220,421,000020,480
3Oct 15, 2026 01:502,49229,344,52020,438,000020,480
4Oct 15, 2026 01:502,50129,525,07620,516,000020,480
5Oct 15, 2026 01:502,50429,566,72520,533,000020,480
6Oct 15, 2026 01:502,50529,548,01220,546,000020,480
7Oct 15, 2026 01:505,83756,883,24144,632,0003,235,00020,480
8Oct 15, 2026 01:505,84956,946,01644,673,0003,290,00020,480
9Oct 15, 2026 01:505,88557,447,54145,002,0003,258,00020,480