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 28, 2026 11:18Dominique GarmierDominique GarmierScore: 16,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 11:1816,652167,420,132133,558,0002,990,0002,502,656
2Mar 28, 2026 11:1816,663164,121,034132,645,0003,989,0002,433,024
3Mar 28, 2026 11:1816,716162,749,493135,069,0002,001,0002,457,600