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:20anboto1anboto1Score: 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:202,919447,040,567431,165,0006,814,00016,793,600
2Jun 24, 2026 16:202,920447,381,428431,200,0006,926,00016,793,600
3Jun 24, 2026 16:202,921448,560,542431,360,0006,830,00016,793,600
4Jun 24, 2026 16:202,921447,500,018431,331,0006,950,00016,793,600
5Jun 24, 2026 16:202,926448,190,330431,876,0007,168,00016,793,600
6Jun 24, 2026 16:202,930448,905,946432,451,0007,190,00016,793,600
7Jun 24, 2026 16:202,936449,578,987433,198,0007,222,00016,793,600
8Jun 24, 2026 16:202,942450,538,583434,135,0007,183,00016,793,600
9Jun 24, 2026 16:202,943450,664,537434,654,0006,856,00016,793,600