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 listJun 23, 2024 20:46Andrey LikhachevAndrey LikhachevScore: 5,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2024 20:465,41499,626,81244,395,59002,248,704
2Jun 23, 2024 20:465,420124,315,36844,440,51602,301,952
3Jun 23, 2024 20:465,426111,534,90544,491,04002,318,336