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:27Andrew EpsteinAndrew EpsteinScore: 6,437Success
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:276,432975,473,721942,611,00022,301,00016,801,792stderr
2Sep 21, 2026 17:276,432975,106,629942,571,00022,246,00016,801,792stderr
3Sep 21, 2026 17:276,433975,360,390942,850,00022,150,00016,801,792stderr
4Sep 21, 2026 17:276,433975,422,645942,934,00022,132,00016,801,792stderr
5Sep 21, 2026 17:276,437976,097,353943,430,00022,202,00016,801,792stderr
6Sep 21, 2026 17:276,438976,032,346943,643,00022,066,00016,801,792stderr
7Sep 21, 2026 17:276,445977,181,038944,609,00022,278,00016,801,792stderr
8Sep 21, 2026 17:276,446978,520,542944,758,00022,193,00016,801,792stderr
9Sep 21, 2026 17:276,448977,731,577945,141,00022,174,00016,801,792stderr