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 16:05Dominique GarmierDominique GarmierScore: 10,167Success
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 16:0510,154108,948,30681,259,0002,006,0002,383,872
2Mar 23, 2026 16:0510,167110,741,21779,350,0004,017,0002,334,720
3Mar 23, 2026 16:0510,542112,428,15582,469,0003,974,0002,412,544