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 24, 2026 11:37Dominique GarmierDominique GarmierScore: 13,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 11:3712,735127,926,79998,404,0006,024,0002,306,048
2Mar 24, 2026 11:3713,025132,405,340101,813,0004,990,0002,387,968
3Mar 24, 2026 11:3715,330151,751,138119,717,0005,985,0002,420,736