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:15Franek KortaFranek KortaScore: 14,719Success
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:1513,914173,040,534114,097,41702,203,648
2Jun 4, 2023 21:1514,719181,654,150120,698,78302,273,280
3Jun 4, 2023 21:1515,727186,667,243128,959,85102,256,896