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 03:06Dominique GarmierDominique GarmierScore: 10,423Success
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 03:0610,353114,841,62283,895,000998,0002,494,464
2Mar 25, 2026 03:0610,423110,832,78782,452,0003,016,0002,416,640
3Mar 25, 2026 03:0610,455113,957,21480,743,0004,984,0002,359,296