Update benchmark and fix lint

Author: maneatingape

README.md

@@ -263,7 +263,7 @@ Performance is reasonable even on older hardware, for example a 2011 MacBook Pro
 | Day | Problem | Solution | Benchmark (μs) |
 | --- | --- | --- | --: |
 | 1 | [Chronal Calibration](https://adventofcode.com/2018/day/1) | [Source](src/year2018/day01.rs) | 16 |
-| 2 | [Inventory Management System](https://adventofcode.com/2018/day/2) | [Source](src/year2018/day02.rs) | 78 |
+| 2 | [Inventory Management System](https://adventofcode.com/2018/day/2) | [Source](src/year2018/day02.rs) | 49 |
 | 3 | [No Matter How You Slice It](https://adventofcode.com/2018/day/3) | [Source](src/year2018/day03.rs) | 55 |
 | 4 | [Repose Record](https://adventofcode.com/2018/day/4) | [Source](src/year2018/day04.rs) | 46 |
 | 5 | [Alchemical Reduction](https://adventofcode.com/2018/day/5) | [Source](src/year2018/day05.rs) | 390 |

src/year2018/day02.rs

@@ -1,5 +1,4 @@
 //! # Inventory Management System
-
 use crate::util::hash::*;
 
 pub fn parse(input: &str) -> Vec<&[u8]> {
@@ -46,7 +45,6 @@ pub fn part1(input: &[&[u8]]) -> u32 {
 
 pub fn part2(input: &[&[u8]]) -> String {
     let width = input[0].len();
-
     let mut seen = FastSet::with_capacity(input.len());
 
     // Use a set to check for duplicates by comparing the prefix and suffix of IDs excluding one
@@ -58,7 +56,7 @@ pub fn part2(input: &[&[u8]]) -> String {
 
             if !seen.insert([prefix, suffix]) {
                 // Convert to String
-                return prefix.iter().chain(suffix).cloned().map(char::from).collect();
+                return prefix.iter().chain(suffix).copied().map(char::from).collect();
             }
         }