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 listSep 1, 2026 14:34Victor MerckléVictor MerckléScore: 2,674Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:07Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:382,66230,128,12720,746,0001,084,0002,121,728stderr
2Sep 1, 2026 14:382,66430,305,36420,718,0001,133,0002,121,728stderr
3Sep 1, 2026 14:382,67030,122,31620,767,0001,135,0002,121,728stderr
4Sep 1, 2026 14:382,67430,712,46020,844,0001,089,0002,121,728stderr
5Sep 1, 2026 14:382,67430,244,58720,792,0001,141,0002,121,728stderr
6Sep 1, 2026 14:385,33552,107,26642,734,0001,018,0002,121,728stderr
7Sep 1, 2026 14:385,35752,339,83742,898,0001,031,0002,121,728stderr
8Sep 1, 2026 14:385,40852,699,97342,269,0002,083,0002,121,728stderr
9Sep 1, 2026 14:385,53653,929,89143,385,0002,017,0002,121,728stderr