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 14, 2026 20:48Tomislav TunkovicTomislav TunkovicScore: 2,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:552,84631,779,56022,206,0001,133,0002,113,536
2Aug 14, 2026 20:552,85332,315,87122,277,0001,120,0002,113,536
3Aug 14, 2026 20:552,85631,887,31622,399,0001,025,0002,113,536
4Aug 14, 2026 20:552,85931,936,23522,318,0001,130,0002,113,536
5Aug 14, 2026 20:552,86032,579,89822,327,0001,127,0002,113,536
6Aug 14, 2026 20:552,86231,706,12122,327,0001,144,0002,113,536
7Aug 14, 2026 20:552,86231,947,27722,339,0001,134,0002,113,536
8Aug 14, 2026 20:552,87331,749,82322,416,0001,146,0002,113,536
9Aug 14, 2026 20:552,91832,465,83822,805,0001,126,0002,113,536