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 24, 2026 12:55olliecrowolliecrowScore: 35,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 12:573,59837,921,10428,493,0001,017,0002,420,736
2Apr 24, 2026 12:573,61437,937,04127,597,0002,044,0002,338,816
3Apr 24, 2026 12:5735,351305,237,356287,881,0001,999,0002,396,160
4Apr 24, 2026 12:5735,353298,750,424285,903,0003,998,0002,375,680
5Apr 24, 2026 12:5735,359307,606,716284,946,0004,999,0002,367,488
6Apr 24, 2026 12:5735,364298,499,869284,993,0004,999,0002,420,736
7Apr 24, 2026 12:5735,419299,016,057285,451,0004,990,0002,363,392
8Apr 24, 2026 12:5735,429299,247,891285,533,0004,991,0002,572,288
9Apr 24, 2026 12:5735,852302,518,458288,976,0005,016,0002,461,696