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 23:50Dominique GarmierDominique GarmierScore: 40,494Success
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 23:5040,435356,540,435329,573,0001,997,0002,510,848
2Mar 24, 2026 23:5040,494350,322,084332,048,00002,269,184
3Mar 24, 2026 23:5040,619355,676,546331,072,0002,000,0002,531,328