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 13:08Josu San MartinJosu San MartinScore: 3,517Success
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 13:093,36838,352,06026,546,0001,078,0002,113,536
2Sep 3, 2026 13:093,44738,416,17227,216,0001,055,0002,113,536
3Sep 3, 2026 13:093,48738,644,29227,555,0001,042,0002,113,536
4Sep 3, 2026 13:093,50438,767,62127,656,0001,079,0002,113,536
5Sep 3, 2026 13:093,51739,587,59227,747,0001,098,0002,113,536
6Sep 3, 2026 13:093,61351,768,19628,489,0001,141,0002,117,632
7Sep 3, 2026 13:0913,687122,865,871111,174,0001,062,0002,113,536
8Sep 3, 2026 13:0913,698123,209,255111,255,0001,071,0002,113,536
9Sep 3, 2026 13:0913,753122,819,083111,729,0001,047,0002,113,536