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 13, 2026 14:26Dominique GarmierDominique GarmierScore: 28,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:2627,976251,955,371228,402,0001,001,0002,297,856
2Mar 13, 2026 14:2628,101256,269,140229,424,0001,001,0002,297,856
3Mar 13, 2026 14:2628,595264,936,082233,481,000997,0002,301,952
4Mar 13, 2026 14:2628,596261,763,073232,487,0002,004,0002,297,856
5Mar 13, 2026 14:2628,634261,551,720232,803,0001,998,0002,297,856
6Mar 13, 2026 14:2628,750263,682,446233,756,0001,997,0002,531,328
7Mar 13, 2026 14:2629,080276,409,156238,460,00002,285,568
8Mar 13, 2026 14:2629,563265,617,999240,415,0002,003,0002,297,856
9Mar 13, 2026 14:2631,678287,391,683257,760,0001,998,0002,293,760