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:14Rajarshi BasuRajarshi BasuScore: 10,093Success
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:1410,065114,368,88181,524,0001,006,0002,326,528
2Dec 31, 2025 08:1410,065109,138,54181,531,0001,006,0002,519,040
3Dec 31, 2025 08:1410,068107,519,28380,546,0002,013,0002,514,944
4Dec 31, 2025 08:1410,072110,938,47582,587,00002,326,528
5Dec 31, 2025 08:1410,093111,192,27180,767,0001,994,0002,514,944
6Dec 31, 2025 08:1410,095111,207,17080,784,0001,994,0002,326,528
7Dec 31, 2025 08:1410,100107,112,72379,825,0002,993,0002,326,528
8Dec 31, 2025 08:1410,100109,549,67881,826,000997,0002,326,528
9Dec 31, 2025 08:1410,109107,990,42781,893,000998,0002,510,848