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 listAug 18, 2026 06:02Josu San MartinJosu San MartinScore: 11,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 06:053,65741,510,24126,980,0003,011,0002,125,824
2Aug 18, 2026 06:053,66039,802,07726,910,0003,110,0002,125,824
3Aug 18, 2026 06:053,66539,778,97526,890,0003,163,0002,125,824
4Aug 18, 2026 06:053,67639,905,47827,028,0003,118,0002,129,920
5Aug 18, 2026 06:0511,656105,337,88792,547,0003,039,0002,129,920
6Aug 18, 2026 06:0511,664105,373,49792,594,0003,051,0002,129,920
7Aug 18, 2026 06:0511,720105,889,85893,007,0003,101,0002,129,920
8Aug 18, 2026 06:0511,739105,932,69893,221,0003,046,0002,125,824
9Aug 18, 2026 06:0511,932107,612,08794,836,0003,014,0002,129,920