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:45Andrew EpsteinAndrew EpsteinScore: 1,566Success
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:461,564243,970,759230,405,0004,225,00016,793,600
2Nov 4, 2026 00:461,565245,010,256230,665,0004,230,00016,793,600
3Nov 4, 2026 00:461,565244,138,689230,504,0004,361,00016,793,600
4Nov 4, 2026 00:461,565244,477,576230,429,0004,373,00016,793,600
5Nov 4, 2026 00:461,566244,696,083230,724,0004,231,00016,793,600
6Nov 4, 2026 00:461,567244,822,254230,850,0004,244,00016,793,600
7Nov 4, 2026 00:461,569245,198,933231,156,0004,297,00016,793,600
8Nov 4, 2026 00:461,570245,279,385231,427,0004,113,00016,793,600
9Nov 4, 2026 00:461,570245,185,842231,277,0004,265,00016,793,600