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 listJul 11, 2025 08:55Valentin KofmanValentin KofmanScore: 7,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 08:557,06279,699,06940,934,00016,972,0002,396,160
2Jul 11, 2025 08:557,28886,534,97848,806,00010,956,0002,383,872
3Jul 11, 2025 08:557,42687,102,72343,921,00016,969,0002,269,184