Shorten the long ass `unsigned long long int' to ulli.

src/list.h

@@ -2,13 +2,15 @@
 #include <gmp.h>
 #include <stdbool.h>
 
+#include "types.h"
+
 /**
  * @brief An infinitely expanding list type.
  */
 typedef struct {
 	mpz_t *list; //!< The list of elements
-	unsigned long long int size; //!< How many elements are in the list
+	ulli size; //!< How many elements are in the list
-	unsigned long long int end; //!< The last element of the list (in use)
+	ulli end; //!< The last element of the list (in use)
 } List;
 
 /**

src/main.c

@@ -5,6 +5,7 @@
 #include <gmp.h>
 
 #include "list.h"
+#include "types.h"
 #include "optimizers.h"
 
 static bool run;
@@ -37,7 +38,7 @@ int main(void) {
 
 	do {
 		// Loop through found primes
-		for(unsigned long long int i = 0; i < primes.size; ++i) {
+		for(ulli i = 0; i < primes.size; ++i) {
 			// If `num' is divisible by a prime then go to the next number
 			if(mpz_divisible_p(num, primes.list[i]) != 0) goto nextPrime;
 		}

src/types.h

@@ -0,0 +1,2 @@
+#pragma once
+typedef unsigned long long int ulli;