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 23:37Josu San MartinJosu San MartinScore: 3,141Success
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 23:383,03934,994,75323,904,0001,022,0002,121,728stderr
2Sep 3, 2026 23:383,05134,990,65124,002,0001,021,0002,121,728stderr
3Sep 3, 2026 23:383,05234,993,74823,993,0001,035,0002,121,728stderr
4Sep 3, 2026 23:383,08035,905,53224,231,0001,027,0002,121,728stderr
5Sep 3, 2026 23:383,14136,840,60324,715,0001,047,0002,121,728stderr
6Sep 3, 2026 23:3815,218136,991,829123,779,0001,016,0002,121,728stderr
7Sep 3, 2026 23:3815,219135,595,514123,793,0001,010,0002,121,728stderr
8Sep 3, 2026 23:3815,280135,291,876124,288,0001,011,0002,121,728stderr
9Sep 3, 2026 23:3815,469136,741,609125,847,0001,006,0002,121,728stderr