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 27, 2026 14:36Dominique GarmierDominique GarmierScore: 165,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:00163,8591,366,868,1561,342,647,000999,0002,297,856
2Mar 27, 2026 10:25165,0231,381,297,3051,352,190,000999,0002,457,600
3Mar 27, 2026 14:36165,0611,380,827,4151,352,504,000999,0002,506,752
4Mar 27, 2026 10:25165,2071,377,913,8721,353,696,000999,0002,461,696
5Mar 27, 2026 13:00165,3391,378,877,7291,355,779,00002,400,256
6Mar 27, 2026 10:25165,3851,387,336,5571,353,155,0002,998,0002,351,104
7Mar 27, 2026 14:36165,4191,382,192,4591,355,439,000999,0002,293,760
8Mar 27, 2026 13:00165,6351,381,407,7391,356,210,0001,998,0002,334,720
9Mar 27, 2026 14:36165,9511,383,898,9911,360,800,00002,412,544