Every gap is a risk.

Place incoming processes. Read their lifetimes. Protect enough contiguous space to survive the next allocation storm.

Learn the system Planned for iPhone and Android

01AllocateFit every request into an unbroken run.

02AnticipateShort and long lifetimes reshape the board.

03SurviveHold the line when the next storm arrives.

Contiguous or nothing

Free space can still fail you.

A request needs one unbroken stretch of cells. Scatter that space into small gaps and the allocator has nowhere to go—even when plenty of memory remains free.

Explore the system

63!25

Built for another run

Same rules. New pressure.

ENDLESS

Outlast the allocator.

Protect your clean-run multiplier through escalating waves and recover before the next storm.

SCENARIOS

Master one problem at a time.

Authored challenges isolate fragmentation, compaction, pinned blocks, and leaks.

DAILY

One seed. One shared test.

Face the same deterministic run and improve your personal best.

Compare ways to play

A surviving memory column breaking through collapsing red blocks

Emergency procedure

Compact now. Pay for it later.

Slide movable processes together to reclaim a usable block—but time keeps moving, requests keep waiting, and every rescue has a cost.

Read the field guide

Allocation pending

How long can you keep it together?

Memory Survival is currently in development. Screens, balance, features, and release plans may change.