The Collatz Conjecture, also known as 3n + 1, is a mathematical problem that has puzzled mathematicians for years. The conjecture states that if you take any positive integer n, and if n is even, ...
Assigns 100,000 elements to an array.
Assigns 1,000 elements to an array.
Base64 is an encoding scheme used to encode binary data in an ASCII format. This benchmark measures the time taken to decode three strings from Base64: "Hello, World!", "The quick brown fox jumps o...
Base64 is an encoding scheme used to encode binary data in an ASCII format. This benchmark measures the time taken to encode three strings to Base64: "Hello, World!", "The quick brown fox jumps ove...
Binary Search is a search algorithm that finds the position of a target value within a sorted array. Performs a binary search through 25 sorted integers for the third, ninth, 13th, 16th, and 21st e...
Bubble Sort is one of the simplest sorting algorithms that repeatedly swaps adjacent elements if they are incorrect. This benchmark measures the time it takes to sort an array of 50 unsorted number...
Benchmark the performance of the `cbrt` function, between 1 and 100,000.
Benchmark the performance of the `cbrt` function, between 1 and 1,000.
Programs that count to 100 million
Programs that count to 1 million
Performs a read operation on a text file containing five paragraphs of Lorem Ipsum. Note that some operating systems and languages may cache the file, so the first run may be slower than subsequent...
Performs an HTTP GET Request to a specified URL.
Performs an HTTP POST Request to a specified URL with "Hello World" as the request body.
Performs a primality test on all numbers between 1 and 100,000.
Jump Search is a search algorithm that "jumps" between elements within a sorted array, then performs a linear search. Performs a linear search through 25 sorted integers for the third, ninth, 13th,...
Linear Search is a search algorithm that finds the position of a target value within any kind of array. Performs a linear search through 50 integers in an array for the 4th, 11th, 29th, 36th, and 4...
Creats a list with 100 elements. List implementations are initialized to their default capacity.
Creats a list with 10,000 elements. List implementations are initialized to their default capacity.
Message Digest 5 (MD5) is a widely used cryptographic hash function that produces a 128-bit (16-byte) hash value. It is commonly used to verify the integrity of data. This benchmark measures the t...
Merge Sort is a sorting algorithm that divides-and-conquers by recursively dividing the array into two halves until each sub-array has only one element. This benchmark measures the time it takes to...
Benchmark the performance of the `pow` function, using decimal numbers.
Programs that iterate through powers of two up to 2^30, through repeated multiplication.
Programs that generate 1,000 random numbers.
Programs that generate 1,000,000 random numbers.
Secure Hash Algorithm 1 (SHA-1) is a widely used cryptographic hash function that produces a 160-bit (20-byte) hash value. It is commonly used to verify the integrity of data. This benchmark measu...
Secure Hash Algorithm 2 (SHA-2) is a family of widely used cryptographic hash functions. SHA-256, its most popular variant, produces a 256-bit (32-byte) hash value. It is commonly used to verify th...
Benchmark the performance of the `sqrt` function, between 1 and 100,000.
Benchmark the performance of the `sqrt` function, between 1 and 1,000.
