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 18:08gchebanovgchebanovScore: 29,421Success
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 18:0828,787290,772,483236,057,46002,224,128
2Jun 27, 2021 18:0829,421301,480,618241,251,06102,244,608
3Jun 27, 2021 18:0831,246315,748,884256,214,33202,232,320