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 listMar 28, 2026 12:04Dominique GarmierDominique GarmierScore: 354,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 12:04352,5822,919,199,5312,887,176,0003,997,0002,531,328
2Mar 28, 2026 12:33353,3112,925,875,9452,895,151,0001,998,0002,519,040
3Mar 28, 2026 12:33353,3142,924,990,2462,896,174,000999,0002,301,952
4Mar 28, 2026 12:04354,2172,929,379,1582,902,579,0001,999,0002,342,912
5Mar 28, 2026 12:04354,8502,940,460,0612,908,775,000999,0002,469,888
6Mar 28, 2026 12:33356,5472,948,402,7252,920,685,0002,998,0002,289,664