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 29, 2021 15:22alex3dalex3dScore: 173,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 15:26164,2231,401,694,3841,346,628,67502,289,664
2Jun 29, 2021 15:26170,4341,455,846,1491,397,558,73602,281,472
3Jun 29, 2021 15:22173,0561,489,382,9561,419,062,35402,293,760
4Jun 29, 2021 15:22173,2801,478,240,9831,420,899,69702,289,664
5Jun 29, 2021 15:22182,6351,554,041,2761,497,610,04502,289,664
6Jun 29, 2021 15:26184,3171,572,590,8991,511,396,59302,289,664