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 listJun 24, 2026 11:28anboto1anboto1Score: 3,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:283,595548,568,175515,495,00023,873,00016,793,600
2Jun 24, 2026 11:283,599549,650,790515,707,00024,151,00016,793,600
3Jun 24, 2026 11:283,600549,101,539516,309,00023,694,00016,793,600
4Jun 24, 2026 11:283,601549,366,910515,710,00024,521,00016,793,600
5Jun 24, 2026 11:283,603549,662,350516,884,00023,627,00016,793,600
6Jun 24, 2026 11:283,604549,933,126516,037,00024,664,00016,793,600
7Jun 24, 2026 11:283,606550,252,391516,923,00024,094,00016,793,600
8Jun 24, 2026 11:283,606550,216,237516,343,00024,624,00016,793,600
9Jun 24, 2026 11:283,607550,307,870516,405,00024,762,00016,793,600