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 15:36Huy Duc LeHuy Duc LeScore: 10,413Success
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 15:3610,198157,199,65983,625,45402,203,648
2Feb 20, 2024 15:3610,413137,348,29085,387,46202,269,184
3Feb 20, 2024 15:3611,036143,376,35090,498,74102,183,168