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:28alex3dalex3dScore: 129,454Success
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:28111,994994,810,700918,353,17902,285,568
2Jun 19, 2021 21:28129,4541,130,804,7331,061,519,28902,269,184
3Jun 19, 2021 21:28136,2811,175,846,9431,117,502,99102,277,376