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 listNov 18, 2025 17:14izotoffizotoffScore: 133,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2025 17:18121,6591,025,870,553820,672,000176,929,0002,514,944
2Nov 18, 2025 17:18128,1441,077,991,523863,817,000186,960,0002,355,200
3Nov 18, 2025 17:14129,1961,085,130,870889,500,000169,904,0002,330,624
4Nov 18, 2025 17:14133,6591,122,692,127914,172,000181,835,0002,473,984
5Nov 18, 2025 17:18135,8341,137,539,292948,012,000165,827,0002,330,624
6Nov 18, 2025 17:14148,8731,245,274,4001,039,940,000180,815,0002,359,296