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 09:48Valentin KofmanValentin KofmanScore: 14,399Success
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 09:4814,370135,402,434115,839,0001,997,0002,273,280
2Jul 7, 2025 09:4814,372139,854,588115,853,0001,997,0002,273,280
3Jul 7, 2025 09:4814,390141,635,489117,000,0001,000,0002,375,680
4Jul 7, 2025 09:4814,392141,559,360116,014,0002,000,0002,273,280
5Jul 7, 2025 09:4814,399139,180,081116,074,0002,001,0002,273,280
6Jul 7, 2025 09:4814,399149,677,983116,074,0002,001,0002,387,968
7Jul 7, 2025 09:4814,402142,717,373116,099,0002,001,0002,383,872
8Jul 7, 2025 09:4814,406142,200,032117,126,0001,001,0002,273,280
9Jul 7, 2025 09:4814,407143,659,336116,132,0002,002,0002,392,064