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:08Rajarshi BasuRajarshi BasuScore: 23,118Success
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:0822,998216,652,912186,589,0001,995,0002,293,760
2Dec 27, 2025 12:0823,118218,552,741187,571,0001,995,0002,285,568
3Dec 27, 2025 12:0823,213214,440,024189,347,0001,001,0002,527,232