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 28, 2021 18:04alex3dalex3dScore: 169,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2021 18:04145,8011,260,999,5921,195,569,53002,301,952
2Jun 28, 2021 18:04169,8801,455,511,9241,393,018,42402,310,144
3Jun 28, 2021 18:04175,0811,491,315,4831,435,667,97902,314,240