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 21, 2026 16:07Dominique GarmierDominique GarmierScore: 18,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:0718,565175,393,942151,235,0001,001,0002,285,568
2Mar 21, 2026 16:0718,613175,722,801151,631,000997,0002,285,568
3Mar 21, 2026 16:0718,661177,869,535151,023,0002,000,0002,322,432