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 16, 2026 15:57M-RochatM-RochatScore: 4,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 15:584,638706,051,500674,494,00021,336,00016,793,600
2May 16, 2026 15:584,716718,695,839685,932,00021,488,00016,793,600
3May 16, 2026 15:584,720718,610,650685,165,00022,960,00016,793,600
4May 16, 2026 15:584,728719,926,911687,886,00021,379,00016,793,600
5May 16, 2026 15:584,734719,019,924688,380,00021,860,00016,793,600
6May 16, 2026 15:584,737720,877,389687,685,00022,938,00016,793,600
7May 16, 2026 15:584,742721,813,923689,605,00021,730,00016,793,600
8May 16, 2026 15:584,753725,446,982689,320,00023,757,00016,793,600
9May 16, 2026 15:584,775725,595,173693,114,00023,199,00016,793,600