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 19, 2025 08:54Aryan JainAryan JainScore: 973,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 08:54966,5967,954,401,9027,733,231,000192,856,0002,306,048
2Mar 19, 2025 08:54968,1217,971,581,8477,734,761,000203,835,0002,306,048
3Mar 19, 2025 08:54968,4817,976,738,3067,746,704,000194,841,0002,306,048
4Mar 19, 2025 08:54970,0037,981,248,0407,744,180,000209,842,0002,281,472
5Mar 19, 2025 08:54973,4388,016,537,7607,780,342,000201,853,0002,281,472
6Mar 19, 2025 08:54973,9988,018,909,2047,787,936,000198,845,0002,281,472
7Mar 19, 2025 08:54974,2238,021,894,4867,791,786,000196,843,0002,277,376
8Mar 19, 2025 08:54974,6668,021,607,0667,788,412,000203,853,0002,457,600
9Mar 19, 2025 08:54977,3428,047,277,8367,818,343,000195,858,0002,277,376