diff --git a/snippets/mostPerformant.md b/snippets/mostPerformant.md
new file mode 100644
index 000000000..192c85a90
--- /dev/null
+++ b/snippets/mostPerformant.md
@@ -0,0 +1,33 @@
+### mostPerformant
+
+Returns the index of the function in an array of functions which executed the fastest.
+
+Use `Array.map()` to generate an array where each value is the total time taken to execute the function
+after `iterations` times. Use the difference in `performance.now()` values before and after to get the total time
+in milliseconds to a high degree of accuracy.
+Use `Math.min()` to find the minimum execution time, and return the index of that shortest time which
+corresponds to the index of the most performant function. Omit the second argument, `iterations`, to use a default of 10,000 iterations. The more iterations, the more reliable the result but the longer it will take.
+
+```js
+const mostPerformant = (fns, iterations = 10000) => {
+  const times = fns.map(fn => {
+    const before = performance.now();
+    for (let i = 0; i < iterations; i++) fn();
+    return performance.now() - before;
+  });
+  return times.indexOf(Math.min(...times));
+};
+```
+
+```js
+mostPerformant([
+  () => {
+    // Loops through the entire array before returning `false`
+    [1, 2, 3, 4, 5, 6, 7, 8, 9, '10'].every(el => typeof el === 'number')
+  },
+  () => {
+    // Only needs to reach index `1` before returning false
+    [1, '2', 3, 4, 5, 6, 7, 8, 9, 10].every(el => typeof el === 'number')
+  }
+]); // 1
+```
diff --git a/tag_database b/tag_database
index 09ba68764..649d26e2f 100644
--- a/tag_database
+++ b/tag_database
@@ -158,6 +158,7 @@ memoize:function
 merge:object,array
 minBy:math,array,function
 minN:array,math
+mostPerformant:function
 negate:function
 nthArg:utility,function
 nthElement:array