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 9, 2024 18:43Mikhail ShirokovMikhail ShirokovScore: 22,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2024 18:4321,515234,979,469176,425,36002,256,896
2Jun 9, 2024 18:4322,439251,533,843183,999,70702,265,088
3Jun 9, 2024 18:4322,537249,571,863184,805,45102,260,992