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 31, 2025 08:15Rajarshi BasuRajarshi BasuScore: 10,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 08:1510,632108,132,05784,179,0003,006,0002,375,680
2Dec 31, 2025 08:1510,658109,189,16085,383,0002,009,0002,322,432
3Dec 31, 2025 08:1510,689112,651,40585,661,0001,992,0002,531,328