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 17, 2026 14:03limanjun99limanjun99Score: 103,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:0383,845717,475,385560,619,000126,913,0002,383,872
2Mar 17, 2026 14:0386,150734,349,456572,539,000133,892,0002,478,080
3Mar 17, 2026 14:0394,788803,780,619653,377,000123,881,0002,310,144
4Mar 17, 2026 14:03100,505851,248,009697,274,000126,867,0002,502,656
5Mar 17, 2026 14:03103,721877,911,497731,584,000118,932,0002,273,280
6Mar 17, 2026 14:03115,693976,903,243816,869,000131,817,0002,494,464
7Mar 17, 2026 14:03116,690987,940,749831,012,000125,850,0002,506,752
8Mar 17, 2026 14:03118,158999,291,583835,050,000133,847,0002,412,544
9Mar 17, 2026 14:03119,4711,006,993,812844,846,000134,815,0002,494,464