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 listNov 9, 2025 15:36Yehor BondarYehor BondarScore: 974,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 15:36967,6327,967,639,6557,738,743,000195,841,0002,277,376
2Nov 9, 2025 15:36971,0037,994,984,6317,768,389,000193,835,0002,285,568
3Nov 9, 2025 15:36972,2978,004,066,4477,781,010,000191,827,0002,306,048
4Nov 9, 2025 15:36974,1158,020,218,9297,779,907,000207,837,0002,301,952
5Nov 9, 2025 15:36974,2398,017,667,4987,792,937,000195,822,0002,396,160
6Nov 9, 2025 15:36974,2428,021,832,9197,794,963,000193,825,0002,301,952
7Nov 9, 2025 15:36974,9918,032,564,6707,806,094,000188,832,0002,277,376
8Nov 9, 2025 15:36975,7168,039,085,1907,801,047,000199,821,0002,277,376
9Nov 9, 2025 15:36978,4708,055,448,1367,830,612,000192,842,0002,342,912