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 listMar 26, 2026 21:59Dominique GarmierDominique GarmierScore: 10,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:597,15189,053,56757,625,0001,010,0002,469,888
2Mar 26, 2026 21:5910,218117,765,69981,795,0001,995,0002,404,352
3Mar 26, 2026 21:5910,257107,515,58783,104,0001,001,0002,265,088