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 19, 2021 21:30alex3dalex3dScore: 136,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 21:30134,5031,166,557,4891,102,923,92302,306,048
2Jun 19, 2021 21:30136,1381,173,954,2271,116,333,19202,301,952
3Jun 19, 2021 21:30147,8971,269,264,2111,212,753,02702,314,240