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 24, 2026 05:25Dominique GarmierDominique GarmierScore: 19,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 05:2518,922176,721,80265,067,00090,093,0002,297,856
2Mar 24, 2026 05:2519,043178,982,30670,070,00086,086,0002,412,544
3Mar 24, 2026 05:2519,105179,890,76162,863,00093,796,0002,342,912