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 20, 2024 12:21Joad NacerJoad NacerScore: 14,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2024 12:2113,230186,004,297108,486,33002,248,704
2May 20, 2024 12:2114,938195,206,462122,492,23102,236,416
3May 20, 2024 12:2115,087191,990,919123,709,44702,191,360