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 listDec 17, 2023 22:28Yurkov AlekseyYurkov AlekseyScore: 33,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2023 22:3031,778320,920,046260,577,37702,269,184
2Dec 17, 2023 22:2832,033323,211,850262,669,79502,269,184
3Dec 17, 2023 22:3032,182338,755,842263,894,60202,277,376
4Dec 17, 2023 22:3032,580332,388,762267,152,29202,260,992
5Dec 17, 2023 22:3033,224327,982,409272,440,85302,265,088
6Dec 17, 2023 22:3033,858339,124,443277,637,21202,260,992
7Dec 17, 2023 22:3033,985351,548,649278,679,24802,260,992
8Dec 17, 2023 22:2834,116341,871,740279,749,11202,265,088
9Dec 17, 2023 22:2834,412336,672,062282,178,38302,269,184