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 29, 2024 17:32Drew GarciaDrew GarciaScore: 157,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 17:3284,509759,473,244692,973,90702,293,760
2Mar 29, 2024 17:32157,5491,358,219,0781,291,898,09202,281,472
3Mar 29, 2024 17:32159,0541,371,708,7951,304,246,81802,277,376