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 16:35anboto1anboto1Score: 2,926Success
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 16:362,923447,815,081431,528,0007,042,00016,793,600
2Jun 24, 2026 16:362,923447,791,584431,460,0007,101,00016,793,600
3Jun 24, 2026 16:362,924448,255,754431,696,0007,025,00016,793,600
4Jun 24, 2026 16:362,924447,846,736431,650,0007,023,00016,793,600
5Jun 24, 2026 16:362,926448,092,165431,857,0007,052,00016,793,600
6Jun 24, 2026 16:362,927448,517,603432,084,0006,975,00016,793,600
7Jun 24, 2026 16:362,933449,262,673432,962,0007,044,00016,793,600
8Jun 24, 2026 16:362,935449,384,757433,310,0007,027,00016,793,600
9Jun 24, 2026 16:362,940450,194,504434,300,0006,738,00016,793,600