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:26Andrew 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:271,572245,246,635231,809,0004,100,00016,023,552
2Nov 4, 2026 00:271,572245,287,900231,571,0004,344,00016,023,552
3Nov 4, 2026 00:271,573245,751,584231,801,0004,206,00016,023,552
4Nov 4, 2026 00:271,573245,655,691231,785,0004,241,00016,023,552
5Nov 4, 2026 00:271,573245,988,390231,781,0004,223,00016,023,552
6Nov 4, 2026 00:271,574245,377,145231,828,0004,290,00016,023,552
7Nov 4, 2026 00:271,574245,413,467231,889,0004,261,00016,023,552
8Nov 4, 2026 00:271,574245,841,130231,897,0004,233,00016,023,552
9Nov 4, 2026 00:271,577246,310,327232,388,0004,283,00016,023,552