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 31, 2021 11:11Ilya AniskovetsIlya AniskovetsScore: 21,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2021 11:0820,789228,396,932170,471,94002,260,992
2Oct 31, 2021 11:1120,911227,094,397171,466,37502,260,992
3Oct 31, 2021 11:0820,991238,388,978172,128,28002,265,088
4Oct 31, 2021 11:1121,332235,743,493174,925,18802,252,800
5Oct 31, 2021 11:1121,443239,793,042175,831,52402,281,472
6Oct 31, 2021 11:0821,903240,151,893179,606,20502,273,280