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 30, 2026 13:29Dominique GarmierDominique GarmierScore: 17,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 13:2917,187165,902,094139,936,000999,0002,330,624
2Mar 30, 2026 13:2917,215168,645,983140,162,0001,001,0002,416,640
3Mar 30, 2026 13:2917,257170,107,718141,507,00002,322,432