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 listAug 28, 2024 09:54GabriellaGabriellaScore: 143,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2024 09:54136,0531,201,681,3381,115,630,81902,293,760
2Aug 28, 2024 09:54143,9561,238,216,3201,180,438,95902,306,048
3Aug 28, 2024 09:54176,8501,524,626,0071,450,169,42302,211,840