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 11, 2021 06:22Sergey StreminSergey StreminScore: 312,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2021 06:22300,0822,533,195,1382,460,672,12602,256,896
2Nov 11, 2021 06:22312,2892,633,210,1712,560,773,17602,318,336
3Nov 11, 2021 06:22320,1972,707,978,6162,625,616,62102,236,416