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:41Huy Duc LeHuy Duc LeScore: 30,778Success
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:4130,626313,869,040251,136,73402,228,224
2Feb 20, 2024 10:4130,778322,351,485252,375,91102,199,552
3Feb 20, 2024 10:4131,470321,540,880258,051,44502,232,320