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 23, 2026 11:21Dominique GarmierDominique GarmierScore: 11,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 11:2111,517117,611,09493,435,0001,004,0002,437,120
2Mar 23, 2026 11:2111,589121,948,81392,026,0003,000,0002,301,952
3Mar 23, 2026 11:2111,595118,919,89094,079,0001,000,0002,420,736