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 listOct 12, 2026 21:37janwwwjanwwwScore: 1,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 21:381,719268,907,105249,877,0008,025,00016,793,600
2Oct 12, 2026 21:381,720269,138,986250,054,0008,019,00016,793,600
3Oct 12, 2026 21:381,721269,219,821250,199,0007,987,00016,793,600
4Oct 12, 2026 21:381,721269,957,760250,191,0007,969,00016,793,600
5Oct 12, 2026 21:381,722269,095,252250,315,0008,004,00016,793,600
6Oct 12, 2026 21:381,722269,503,701250,360,0008,073,00016,793,600
7Oct 12, 2026 21:381,722268,768,538250,342,0008,010,00016,793,600
8Oct 12, 2026 21:381,723269,160,481250,244,0008,270,00016,793,600
9Oct 12, 2026 21:381,723269,021,651250,498,0008,055,00016,793,600