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 09:21Dominique GarmierDominique GarmierScore: 12,889Success
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 09:2112,889137,017,336101,700,0003,988,0002,342,912
2Mar 30, 2026 09:2112,889130,583,349104,692,000997,0002,478,080
3Mar 30, 2026 09:2112,891134,677,772103,715,0001,994,0002,379,776