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 listMay 17, 2024 19:40Joad NacerJoad NacerScore: 47,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2024 19:4046,515444,035,879381,419,87002,211,840
2May 17, 2024 19:4047,949465,466,918393,181,41602,269,184
3May 17, 2024 19:4049,950462,128,022409,590,44302,256,896