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 27, 2026 01:58Dominique GarmierDominique GarmierScore: 12,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 01:583,48553,079,14824,497,0004,082,0002,445,312
2Mar 27, 2026 01:5812,465123,589,547100,212,0002,004,0002,338,816
3Mar 27, 2026 01:5812,500130,524,80199,490,0003,014,0002,396,160