hardNewNVIDIAAMDTogether AI

Write a tiled GEMM in CUDA C, then optimize it: shared memory, register blocking, vector loads, tensor cores.

The live kernel round asks for a correct GEMM, then for "now make it faster". The answer climbs five rungs and names what each one buys: bytes per FLOP from global memory, loads per FMA from shared memory, or fewer instructions per byte.

Updated Oct 2026 · Worked answers on inference mechanisms, with calculations, implementation details, and follow-up questions.

10 answers per topic instead of 5, plus saved progress and bookmarks · costs nothingor unlock all 213 remaining answers · $25

Every worked answer and derivation in all 12 topics, every concept page, the full practice-test bank, and every code drill’s edge-case tests and reference solution.

6 months · One payment · No auto-renewal

UP NEXT ON YOUR JOURNEY

Next in this trackWrite a block reduction and an inclusive prefix scan in CUDA C with warp shuffles, correct for any n.Next in this trackWrite a numerically safe row softmax kernel in CUDA C, with an online max and sum merged by warp shuffles.Next in this trackImplement a priority scheduler for a paged KV pool, with preemption and aging so low-priority requests cannot starve.

DISCUSSION · 0

Nobody has commented on this answer. Add a correction or another way to work it.