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 26, 2026 21:44Dominique GarmierDominique GarmierScore: 18,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:4418,749176,296,66663,892,00089,848,0002,396,160
2Mar 26, 2026 21:4418,772180,687,69962,973,00090,961,0002,482,176
3Mar 26, 2026 21:4418,864177,771,11963,868,00090,813,0002,396,160