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 13, 2026 13:46highload-churnerhighload-churnerScore: 120,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 13:47112,997935,637,332919,538,0007,042,00036,864stderr
2Oct 13, 2026 13:47114,139944,909,859925,163,00010,784,00036,864stderr
3Oct 13, 2026 13:47118,469980,535,579958,204,00013,242,00036,864stderr
4Oct 13, 2026 13:47120,381996,189,955973,743,00013,388,00036,864stderr
5Oct 13, 2026 13:47120,443996,755,508974,425,00013,213,00036,864stderr
6Oct 13, 2026 13:47120,838999,940,053975,305,00015,571,00036,864stderr
7Oct 13, 2026 13:47123,9551,025,657,026999,985,00016,451,00036,864stderr
8Oct 13, 2026 13:47132,4361,095,109,4731,061,123,00024,855,00036,864stderr
9Oct 13, 2026 13:47138,5891,145,509,3781,108,581,00027,855,00036,864stderr