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:49Sergey StreminSergey StreminScore: 59,779Success
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:4957,821537,697,108474,131,13802,256,896
2Jun 12, 2021 20:4959,779550,903,004490,186,41402,256,896
3Jun 12, 2021 20:4962,047574,180,225508,784,26102,244,608