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 09:42Dominique GarmierDominique GarmierScore: 10,376Success
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 09:4210,369113,133,73283,025,0002,000,0002,277,376
2Mar 24, 2026 09:4210,376113,408,29584,080,0001,000,0002,306,048
3Mar 24, 2026 09:4210,406111,410,91384,323,0001,003,0002,301,952