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 8, 2026 20:26Victor MerckléVictor MerckléScore: 2,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 20:282,55229,417,77320,934,000024,576stderr
2Sep 8, 2026 20:282,57129,573,74020,082,0001,007,00024,576stderr
3Sep 8, 2026 20:282,59429,476,53821,275,000024,576stderr
4Sep 8, 2026 20:282,60829,797,14721,391,000024,576stderr
5Sep 8, 2026 20:282,61730,612,50221,465,000024,576stderr
6Sep 8, 2026 20:282,62530,381,87420,513,0001,017,00024,576stderr
7Sep 8, 2026 20:282,62729,779,04321,546,000024,576stderr
8Sep 8, 2026 20:282,62830,726,40821,556,000024,576stderr
9Sep 8, 2026 20:282,63129,826,58821,581,000024,576stderr