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 08:25Dominique GarmierDominique GarmierScore: 158,377Success
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 08:25156,8981,307,351,9051,284,567,0001,999,0002,375,680
2Mar 24, 2026 08:25158,3771,322,207,1711,298,695,00002,363,392
3Mar 24, 2026 08:25158,4701,322,578,1691,298,456,000999,0002,396,160