Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listNov 4, 2026 00:03Andrew EpsteinAndrew EpsteinScore: 1,573Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 00:041,570244,906,160231,240,0004,373,00016,793,600
2Nov 4, 2026 00:041,572245,701,829231,543,0004,391,00016,793,600
3Nov 4, 2026 00:041,573245,625,993231,873,0004,172,00016,793,600
4Nov 4, 2026 00:041,573245,729,571231,680,0004,361,00016,793,600
5Nov 4, 2026 00:041,573245,879,983231,860,0004,147,00016,793,600
6Nov 4, 2026 00:041,573245,797,608231,765,0004,227,00016,793,600
7Nov 4, 2026 00:041,576246,095,150232,145,0004,274,00016,793,600
8Nov 4, 2026 00:041,576246,297,661232,242,0004,280,00016,793,600
9Nov 4, 2026 00:041,578246,427,323232,592,0004,137,00016,793,600