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 25, 2026 05:44Dominique GarmierDominique GarmierScore: 31,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 05:4431,367280,968,496180,146,00077,062,0002,453,504
2Mar 25, 2026 05:4431,507285,837,253132,183,000126,175,0002,502,656
3Mar 25, 2026 05:4431,540285,991,731164,761,00093,864,0002,273,280