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 listMar 12, 2026 23:42Viktor VarbanovViktor VarbanovScore: 973,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 23:42965,2387,950,204,6137,715,131,000199,822,0002,277,376
2Mar 12, 2026 23:42967,1747,963,571,8927,736,002,000194,823,0002,277,376
3Mar 12, 2026 23:42970,7147,997,688,9737,762,036,000197,822,0002,277,376
4Mar 12, 2026 23:42972,5338,003,759,3087,774,926,000199,843,0002,273,280
5Mar 12, 2026 23:42973,1958,012,920,6497,783,364,000196,832,0002,277,376
6Mar 12, 2026 23:42973,8358,013,065,2877,788,609,000196,838,0002,277,376
7Mar 12, 2026 23:42975,5148,031,611,5137,793,389,000205,825,0002,277,376
8Mar 12, 2026 23:42979,2308,060,569,0997,839,862,000189,827,0002,306,048
9Mar 12, 2026 23:42979,9098,064,665,3337,832,425,000202,829,0002,277,376