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:32Elijah KinElijah KinScore: 972,189Success
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:32966,9747,962,836,9477,732,355,000196,830,0002,322,432
2Mar 14, 2026 20:32968,6217,975,661,6967,749,869,000192,822,0002,277,376
3Mar 14, 2026 20:32970,8437,993,398,1227,759,091,000201,820,0002,277,376
4Mar 14, 2026 20:32972,0888,011,858,3807,782,287,000188,837,0002,277,376
5Mar 14, 2026 20:32972,1898,004,980,2787,773,104,000198,849,0002,277,376
6Mar 14, 2026 20:32972,4048,007,719,6137,786,885,000186,829,0002,277,376
7Mar 14, 2026 20:32973,9788,015,301,6907,797,772,000188,849,0002,277,376
8Mar 14, 2026 20:32975,5118,039,630,2897,797,360,000201,828,0002,318,336
9Mar 14, 2026 20:32975,6798,034,818,7767,814,720,000185,850,0002,314,240