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 27, 2021 17:42gchebanovgchebanovScore: 47,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 17:4247,537454,623,050389,801,50302,224,128
2Jun 27, 2021 17:4247,739458,849,930391,461,69702,232,320
3Jun 27, 2021 17:4247,758471,995,324391,611,64802,228,224