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:11Andrew EpsteinAndrew EpsteinScore: 15,855Success
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:1215,8512,387,161,9232,339,776,00037,885,00016,801,792stderr
2Nov 4, 2026 00:1215,8512,387,476,0512,339,516,00038,275,00016,801,792stderr
3Nov 4, 2026 00:1215,8512,387,760,8482,339,894,00037,886,00016,801,792stderr
4Nov 4, 2026 00:1215,8552,387,900,6192,340,156,00038,166,00016,801,792stderr
5Nov 4, 2026 00:1215,8552,387,969,9762,339,824,00038,517,00016,801,792stderr
6Nov 4, 2026 00:1215,8562,388,451,4672,340,539,00037,906,00016,801,792stderr
7Nov 4, 2026 00:1215,8842,392,084,0182,344,418,00038,247,00016,801,792stderr
8Nov 4, 2026 00:1215,8872,392,723,5672,344,681,00038,433,00016,801,792stderr
9Nov 4, 2026 00:1215,8872,393,027,1102,344,724,00038,436,00016,801,792stderr