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 listApr 15, 2026 20:49zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:0408,796,5131,069,000020,480No answer to stdout. Died or killed?
2Apr 15, 2026 20:492,78850,652,68221,870,000994,0002,502,656
3Apr 15, 2026 20:492,80249,767,39021,976,000998,0002,469,888
4Apr 15, 2026 20:492,80344,374,99321,989,000999,0002,347,008
5Apr 15, 2026 20:492,80848,081,52521,027,0002,002,0002,363,392
6Apr 15, 2026 20:492,81244,427,21421,052,0002,004,0002,310,144
7Apr 15, 2026 20:492,81546,261,41622,083,0001,003,0002,437,120
8Apr 15, 2026 20:492,82036,253,72321,111,0002,010,0002,318,336
9Apr 15, 2026 20:495,34274,165,46141,811,0001,991,0002,396,160
10Apr 15, 2026 20:495,34367,599,05941,821,0001,991,0002,269,184