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 05:00highload-churnerhighload-churnerScore: 2,496Success
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 05:012,49229,492,08820,438,000020,480
2Oct 15, 2026 05:012,49329,485,14020,450,000020,480
3Oct 15, 2026 05:012,49429,523,87620,454,000020,480
4Oct 15, 2026 05:012,49429,420,36520,452,000020,480
5Oct 15, 2026 05:012,49629,480,96220,474,000020,480
6Oct 15, 2026 05:012,49729,526,33720,481,000020,480
7Oct 15, 2026 05:012,51429,610,50920,617,000020,480
8Oct 15, 2026 05:013,47737,618,08825,223,0003,290,00020,480
9Oct 15, 2026 05:013,56938,278,42825,967,0003,299,00020,480