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 17, 2026 14:21Dominique GarmierDominique GarmierScore: 18,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:2118,735176,636,619153,624,00002,469,888
2Mar 17, 2026 14:2118,754182,524,010151,786,0001,997,0002,469,888
3Mar 17, 2026 14:2118,770177,915,221151,919,0001,998,0002,285,568