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 7, 2025 21:40Valentin KofmanValentin KofmanScore: 9,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 21:409,762103,176,09978,046,0002,001,0002,478,080
2Jul 7, 2025 21:589,769103,093,51578,103,0002,002,0002,330,624
3Jul 7, 2025 21:589,770106,927,51678,113,0002,002,0002,260,992
4Jul 7, 2025 21:409,783102,571,56078,219,0002,005,0002,330,624
5Jul 7, 2025 21:589,798109,276,90578,335,0002,008,0002,265,088
6Jul 7, 2025 21:409,801111,768,61878,361,0002,009,0002,490,368