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 15:53anboto1anboto1Score: 2,929Success
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 15:542,919446,954,374431,027,0006,824,00016,793,600
2Jun 24, 2026 15:542,920447,448,297431,179,0006,917,00016,793,600
3Jun 24, 2026 15:542,926448,228,266432,065,0006,955,00016,793,600
4Jun 24, 2026 15:542,928448,509,758432,071,0007,253,00016,793,600
5Jun 24, 2026 15:542,929448,558,856432,172,0007,315,00016,793,600
6Jun 24, 2026 15:542,930448,848,999432,447,0007,175,00016,793,600
7Jun 24, 2026 15:542,938450,033,271433,872,0006,975,00016,793,600
8Jun 24, 2026 15:542,939450,118,904433,889,0007,053,00016,793,600
9Jun 24, 2026 15:543,527538,469,769521,275,0007,845,00016,793,600