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 02:36Andrew EpsteinAndrew EpsteinScore: 1,547Success
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 02:371,545241,575,739227,645,0004,225,00016,793,600
2Nov 4, 2026 02:371,546241,260,647227,867,0004,128,00016,793,600
3Nov 4, 2026 02:371,546241,612,358227,730,0004,225,00016,793,600
4Nov 4, 2026 02:371,546241,603,159227,692,0004,213,00016,793,600
5Nov 4, 2026 02:371,547241,832,317227,845,0004,254,00016,793,600
6Nov 4, 2026 02:371,547241,812,035227,804,0004,291,00016,793,600
7Nov 4, 2026 02:371,549242,786,634228,209,0004,287,00016,793,600
8Nov 4, 2026 02:371,549242,508,263228,347,0004,143,00016,793,600
9Nov 4, 2026 02:371,550242,234,475228,271,0004,300,00016,793,600