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 listOct 30, 2021 10:11Jules MinierJules MinierScore: 111,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2021 10:11108,9461,468,145,270893,360,77702,342,912
2Oct 30, 2021 10:11111,0631,490,612,831910,719,03702,256,896
3Oct 30, 2021 10:11112,4541,499,315,137922,120,44502,224,128