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 listApr 28, 2025 11:53KeefeKeefeScore: 15,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2025 11:5315,200146,858,454123,643,000997,0002,367,488
2Apr 28, 2025 11:5315,201150,597,668123,651,000997,0002,260,992
3Apr 28, 2025 11:5315,205152,648,543122,684,0001,994,0002,260,992
4Apr 28, 2025 11:5315,206155,850,777122,696,0001,995,0002,355,200
5Apr 28, 2025 11:5315,207150,944,000122,701,0001,995,0002,260,992
6Apr 28, 2025 11:5315,213152,913,718123,747,000997,0002,359,296
7Apr 28, 2025 11:5315,215143,471,007123,768,000998,0002,359,296
8Apr 28, 2025 11:5315,231148,175,461122,898,0001,998,0002,371,584
9Apr 28, 2025 11:5315,232146,502,347122,901,0001,998,0002,260,992