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 14, 2026 20:55Elijah KinElijah KinScore: 103,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 20:5587,222743,300,797519,436,000195,787,0002,387,968
2Mar 14, 2026 20:5591,836785,611,231557,304,000195,755,0002,371,584
3Mar 14, 2026 20:5595,131807,205,619577,317,000202,760,0002,310,144
4Mar 14, 2026 20:5598,000829,145,016605,696,000197,900,0002,363,392
5Mar 14, 2026 20:55103,906880,814,958662,247,000189,784,0002,310,144
6Mar 14, 2026 20:55105,720895,452,250666,157,000200,746,0002,306,048
7Mar 14, 2026 20:55111,683945,792,797727,049,000188,753,0002,416,640
8Mar 14, 2026 20:55117,793994,081,924774,123,000191,782,0002,416,640
9Mar 14, 2026 20:55119,1381,005,465,051768,159,000208,771,0002,306,048