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 listSep 21, 2026 17:25Andrew EpsteinAndrew EpsteinScore: 1,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:251,586247,483,315233,736,0004,262,00016,793,600
2Sep 21, 2026 17:251,586247,443,175233,684,0004,352,00016,793,600
3Sep 21, 2026 17:251,586247,385,649233,613,0004,352,00016,793,600
4Sep 21, 2026 17:251,587247,425,595233,683,0004,391,00016,793,600
5Sep 21, 2026 17:251,587247,641,616233,880,0004,276,00016,793,600
6Sep 21, 2026 17:251,587247,475,742233,817,0004,249,00016,793,600
7Sep 21, 2026 17:251,590248,085,302234,362,0004,264,00016,793,600
8Sep 21, 2026 17:251,590248,040,473234,367,0004,256,00016,793,600
9Sep 21, 2026 17:251,591248,089,551234,425,0004,261,00016,793,600