I have created a crate called fibonacci-numbers. There are 187 different major versions of the crate, each exporting the Fibonacci number corresponding to that version.
<...>
Version 186 depends on version 184 and 185 and exports the largest Fibonacci number that fits in a u128:

pub const VALUE: u128 = fib184::VALUE + fib185::VALUE;

esotoric [sic!] programming language that's read like a spellbook

begin the grimoire.
summon the power with essence of 7.
conjure ritual named amplify with value to return value multiplied by value.
enchant power with essence 0 of through ritual amplify with power.
inscribe whispers of "the power is amplified: " bound with power.
close the grimoire.

In the unlikely case that you have very little RAM and a surplus of video RAM, you can use the latter as swap.

#include <stdio.h>

int main() {
  puts("Hello world");
  asm("/*");
  /* Nested comment */
  for (int i = 0; i < 10; i++) puts("I LIKE PANCAKES!");
  asm("*/");
  puts("Goodbye world");
}

#include <stdio.h>

int main(int i) {

  do do do do "baby shark!";

  while (++i % 2);
  while (i == 2);
  while (i % 3); 
  while (i % 7);

  printf("The answer is %d.\n", i);

}