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 14:34Huy Duc LeHuy Duc LeScore: 15,208Success
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 14:3413,605183,927,731111,563,47702,236,416
2Feb 20, 2024 14:3415,208179,287,280124,708,32202,220,032
3Feb 20, 2024 14:3418,745212,358,146153,711,28202,207,744