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 listMay 20, 2026 17:04M-RochatM-RochatScore: 4,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:044,152632,246,676601,663,00021,262,00016,793,600
2May 20, 2026 17:044,152633,002,374601,807,00021,054,00016,793,600
3May 20, 2026 17:044,152632,196,014601,693,00021,182,00016,793,600
4May 20, 2026 17:044,156634,255,164602,144,00021,401,00016,793,600
5May 20, 2026 17:044,156632,866,828602,237,00021,230,00016,793,600
6May 20, 2026 17:044,156633,651,302602,410,00021,069,00016,793,600
7May 20, 2026 17:044,158636,054,638602,519,00021,306,00016,793,600
8May 20, 2026 17:044,160635,007,305602,803,00021,260,00016,793,600
9May 20, 2026 17:044,172636,862,584605,234,00020,656,00016,793,600