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 19, 2021 21:37alex3dalex3dScore: 136,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 21:37136,7991,180,897,8051,121,748,89602,322,432
2Jun 19, 2021 21:37136,9591,183,920,6121,123,062,37502,318,336
3Jun 19, 2021 21:37143,7471,241,275,4821,178,725,54602,314,240