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 listSep 28, 2023 14:52apuxbtapuxbtScore: 46,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 14:5245,812449,618,558375,658,20802,256,896
2Sep 28, 2023 14:5246,614444,355,334382,234,31602,273,280
3Sep 28, 2023 14:5249,190486,360,898403,355,14502,252,800