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 listMay 7, 2026 20:33Pavel SkripkinPavel SkripkinScore: 5,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:345,55160,011,09637,270,0008,250,0002,494,464
2May 7, 2026 20:345,56858,957,26737,358,0008,306,0002,314,240
3May 7, 2026 20:345,66361,308,71537,912,0008,526,0002,514,944
4May 7, 2026 20:345,68664,067,19538,256,0008,372,0002,367,488
5May 7, 2026 20:345,74064,512,72338,471,0008,599,0002,392,064
6May 7, 2026 20:345,80864,241,83338,749,0008,880,0002,351,104
7May 7, 2026 20:345,90465,667,66739,127,0009,291,0002,355,200
8May 7, 2026 20:345,90663,601,21039,479,0008,957,0002,338,816
9May 7, 2026 20:346,10565,893,04940,189,0009,874,0002,396,160