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 9, 2025 08:46Valentin KofmanValentin KofmanScore: 7,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2025 08:466,83678,717,90640,041,00016,016,0002,371,584
2Jul 9, 2025 08:467,04287,057,11939,823,00017,920,0002,514,944
3Jul 9, 2025 08:467,37781,438,07544,359,00016,130,0002,400,256