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 12, 2021 20:53Sergey StreminSergey StreminScore: 64,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 20:5361,568567,984,594504,856,44602,248,704
2Jun 12, 2021 20:5364,455598,348,720528,527,61702,260,992
3Jun 12, 2021 20:5366,354600,262,165544,106,54202,252,800