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 3, 2026 21:53Josu San MartinJosu San MartinScore: 3,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:533,23336,440,61025,474,0001,038,0002,121,728stderr
2Sep 3, 2026 21:533,24236,781,67125,544,0001,043,0002,121,728stderr
3Sep 3, 2026 21:533,24336,663,69325,546,0001,047,0002,121,728stderr
4Sep 3, 2026 21:533,24737,299,21525,595,0001,037,0002,121,728stderr
5Sep 3, 2026 21:533,25637,040,95325,662,0001,045,0002,121,728stderr
6Sep 3, 2026 21:533,25936,826,45225,707,0001,021,0002,121,728stderr
7Sep 3, 2026 21:533,27336,746,04825,797,0001,044,0002,121,728stderr
8Sep 3, 2026 21:5315,461136,830,541125,765,0001,022,0002,121,728stderr
9Sep 3, 2026 21:5315,486136,921,323125,968,0001,024,0002,121,728stderr