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 listDec 27, 2025 12:14Rajarshi BasuRajarshi BasuScore: 10,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 12:1410,738112,508,15083,052,0005,003,0002,285,568
2Dec 27, 2025 12:1410,849116,823,24085,964,0002,998,0002,285,568
3Dec 27, 2025 12:1410,871116,384,99886,138,0003,004,0002,510,848