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 listJun 18, 2026 15:57Maya RebholzMaya RebholzScore: 10,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 15:589,64688,997,60578,088,0001,014,0002,113,536
2Jun 18, 2026 15:589,64688,797,61278,090,0001,015,0002,113,536
3Jun 18, 2026 15:589,65288,363,03278,134,0001,020,0002,113,536
4Jun 18, 2026 15:589,68388,597,48678,392,0001,014,0002,113,536
5Jun 18, 2026 15:5810,39794,377,24584,245,0001,013,0002,113,536
6Jun 18, 2026 15:5810,44095,331,83584,591,0001,023,0002,113,536
7Jun 18, 2026 15:5810,47095,221,09684,835,0001,019,0002,113,536
8Jun 18, 2026 15:5810,47695,172,30584,837,0001,074,0002,113,536
9Jun 18, 2026 15:5810,47795,473,80484,870,0001,046,0002,113,536