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 10:33Ilya AniskovetsIlya AniskovetsScore: 22,367Success
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 10:3521,686247,063,715177,825,08702,277,376
2Oct 31, 2021 10:3322,108244,405,856181,285,10402,269,184
3Oct 31, 2021 10:3522,314259,464,063182,971,71102,285,568
4Oct 31, 2021 10:3522,367255,147,303183,407,69102,252,800
5Oct 31, 2021 10:3322,399240,832,660183,670,52802,269,184
6Oct 31, 2021 10:3322,601244,528,999185,328,73102,252,800