23 Microsecond is my best so far just going to commit and be done for tonight
This commit is contained in:
@@ -103,7 +103,7 @@ use std::path::Path;
|
|||||||
// fn compute(mut left: Vec<i32>, mut right: Vec<i32>) -> i32 {
|
// fn compute(mut left: Vec<i32>, mut right: Vec<i32>) -> i32 {
|
||||||
// left.iter().fold(0, |sum, left_item| sum + (left_item * (right.iter().filter(|&n| n == left_item).count() as i32)))
|
// left.iter().fold(0, |sum, left_item| sum + (left_item * (right.iter().filter(|&n| n == left_item).count() as i32)))
|
||||||
// }
|
// }
|
||||||
|
#[inline(always)]
|
||||||
fn compute(mut left: Vec<i32>, mut right: Vec<i32>) -> i32 {
|
fn compute(mut left: Vec<i32>, mut right: Vec<i32>) -> i32 {
|
||||||
let mut sum = 0;
|
let mut sum = 0;
|
||||||
for left_item in left.iter() {
|
for left_item in left.iter() {
|
||||||
@@ -111,7 +111,7 @@ fn compute(mut left: Vec<i32>, mut right: Vec<i32>) -> i32 {
|
|||||||
}
|
}
|
||||||
sum
|
sum
|
||||||
}
|
}
|
||||||
|
#[inline(always)]
|
||||||
fn load_lists() -> (Vec<i32>, Vec<i32>) {
|
fn load_lists() -> (Vec<i32>, Vec<i32>) {
|
||||||
let mut left: Vec<i32> = vec![0];
|
let mut left: Vec<i32> = vec![0];
|
||||||
let mut right: Vec<i32> = vec![0];
|
let mut right: Vec<i32> = vec![0];
|
||||||
|
|||||||
Reference in New Issue
Block a user