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 29, 2026 21:14Dominique GarmierDominique GarmierScore: 197,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 21:14195,6421,624,923,1521,602,265,0001,999,0002,289,664
2Mar 29, 2026 22:41197,2701,639,085,1481,615,619,0001,999,0002,289,664
3Mar 29, 2026 22:41197,5091,646,633,3751,619,573,00002,490,368
4Mar 29, 2026 21:14197,5661,649,530,7011,617,041,0002,998,0002,478,080
5Mar 29, 2026 21:14197,5861,644,914,0171,618,208,0001,999,0002,510,848
6Mar 29, 2026 22:41198,1401,654,024,9381,622,752,0001,999,0002,318,336