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 4, 2023 21:40Franek KortaFranek KortaScore: 15,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2023 21:4014,577177,135,546119,530,30702,277,376
2Jun 4, 2023 21:4015,229182,269,470124,874,64002,252,800
3Jun 4, 2023 21:4016,718203,102,155137,084,76602,236,416