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 26, 2025 03:05Josu San MartinJosu San MartinScore: 16,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:0516,571162,032,975133,887,0001,998,0002,277,376
2Dec 26, 2025 03:0516,582164,183,139134,973,000999,0002,351,104
3Dec 26, 2025 03:0516,582160,743,588134,973,000999,0002,277,376
4Dec 26, 2025 03:0516,602157,981,089135,137,0001,001,0002,347,008
5Dec 26, 2025 03:0516,619159,589,000135,275,0001,002,0002,433,024
6Dec 26, 2025 03:0516,623159,249,638135,306,0001,002,0002,277,376
7Dec 26, 2025 03:0516,635162,370,403135,402,0001,002,0002,277,376
8Dec 26, 2025 03:0516,643161,796,858135,472,0001,003,0002,277,376
9Dec 26, 2025 03:0516,645166,349,965136,487,00002,277,376