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 15, 2026 00:22Tomislav TunkovicTomislav TunkovicScore: 2,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 00:232,66930,987,02220,762,0001,128,0002,113,536
2Aug 15, 2026 00:232,67430,383,53020,801,0001,130,0002,113,536
3Aug 15, 2026 00:232,67431,217,82120,788,0001,141,0002,113,536
4Aug 15, 2026 00:232,67530,383,19620,819,0001,117,0002,113,536
5Aug 15, 2026 00:232,68530,557,00120,890,0001,132,0002,113,536
6Aug 15, 2026 00:232,68831,150,22920,918,0001,126,0002,113,536
7Aug 15, 2026 00:232,68830,550,12820,914,0001,128,0002,113,536
8Aug 15, 2026 00:232,69130,686,32821,035,0001,033,0002,113,536
9Aug 15, 2026 00:235,47353,351,37943,797,0001,089,0002,113,536