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 listNov 27, 2022 17:27apuxbtapuxbtScore: 983,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 17:27983,7728,122,340,8938,066,927,14802,289,664
2Nov 27, 2022 17:27983,8648,129,728,3268,067,684,86902,297,856
3Nov 27, 2022 17:27986,3458,142,977,1338,088,031,32602,285,568