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 6, 2025 09:16Valentin KofmanValentin KofmanScore: 18,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 09:1618,287172,998,013148,957,000999,0002,387,968
2Jul 6, 2025 09:1618,291179,607,525147,990,0001,999,0002,387,968
3Jul 6, 2025 09:1618,309175,059,161149,136,0001,000,0002,269,184
4Jul 6, 2025 09:1618,339178,023,335149,377,0001,002,0002,379,776
5Jul 6, 2025 09:1618,341174,561,644149,398,0001,002,0002,383,872
6Jul 6, 2025 09:1618,352181,059,806149,481,0001,003,0002,387,968
7Jul 6, 2025 09:1618,395179,181,931148,839,0001,997,0002,260,992
8Jul 6, 2025 09:1618,399174,862,200148,874,0001,998,0002,506,752
9Jul 6, 2025 09:1618,402173,856,416148,899,0001,998,0002,269,184