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 listNov 4, 2026 19:11e1011e1011Score: 112,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 19:1291,366760,141,752607,838,000141,368,0002,113,536
2Nov 4, 2026 19:1298,434819,428,538665,801,000141,360,0002,113,536
3Nov 4, 2026 19:12100,817838,241,486685,788,000140,918,0002,113,536
4Nov 4, 2026 19:12108,760902,644,840750,693,000141,139,0002,113,536
5Nov 4, 2026 19:12112,218931,709,146779,456,000140,733,0002,113,536
6Nov 4, 2026 19:12119,028986,851,168834,184,000141,853,0002,113,536
7Nov 4, 2026 19:12120,295997,424,792845,567,000140,853,0002,113,536
8Nov 4, 2026 19:12132,6661,099,916,780947,150,000140,716,0002,113,536
9Nov 4, 2026 19:12136,7461,132,444,042981,359,000139,960,0002,113,536