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 25, 2025 18:42Drew GarciaDrew GarciaScore: 31,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2025 18:4230,351278,595,363247,880,000999,0002,269,184
2Mar 25, 2025 18:4230,628276,068,188250,153,0001,000,0002,408,448
3Mar 25, 2025 18:4230,770276,235,327251,314,0001,001,0002,404,352
4Mar 25, 2025 18:4230,947280,743,554252,769,000999,0002,404,352
5Mar 25, 2025 18:4231,088280,297,242252,926,0001,999,0002,404,352
6Mar 25, 2025 18:4231,105278,397,674253,058,0002,000,0002,408,448
7Mar 25, 2025 18:4231,612283,109,983258,217,0001,000,0002,396,160
8Mar 25, 2025 18:4231,722283,168,679258,123,0002,000,0002,269,184
9Mar 25, 2025 18:4231,725289,701,500258,148,0002,001,0002,396,160