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:38Andrew EpsteinAndrew EpsteinScore: 18,734Success
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:3918,7292,819,082,7512,758,800,00050,685,00016,805,888stderr
2Nov 4, 2026 02:3918,7302,819,254,3452,758,529,00051,068,00016,805,888stderr
3Nov 4, 2026 02:3918,7312,819,254,3072,759,114,00050,650,00016,805,888stderr
4Nov 4, 2026 02:3918,7342,819,854,9002,759,542,00050,683,00016,805,888stderr
5Nov 4, 2026 02:3918,7342,819,681,2202,759,751,00050,466,00016,801,792stderr
6Nov 4, 2026 02:3918,7362,820,638,4362,759,405,00051,043,00016,805,888stderr
7Nov 4, 2026 02:3918,7732,825,941,9762,765,062,00050,983,00016,801,792stderr
8Nov 4, 2026 02:3918,7742,825,621,6202,765,152,00051,014,00016,805,888stderr
9Nov 4, 2026 02:3918,7782,826,579,9222,765,728,00051,034,00016,805,888stderr