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 listFeb 20, 2024 10:43Huy Duc LeHuy Duc LeScore: 31,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2024 10:4329,804302,200,116244,389,58202,256,896
2Feb 20, 2024 10:4331,093329,111,912254,965,62102,297,856
3Feb 20, 2024 10:4331,995327,349,387262,361,95502,297,856