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 listAug 30, 2026 22:54Victor MerckléVictor MerckléScore: 1,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:581,579245,300,696232,771,0004,116,00016,801,792stderr
2Aug 30, 2026 22:581,580245,676,564232,929,0004,187,00016,801,792stderr
3Aug 30, 2026 22:581,580245,720,963232,930,0004,160,00016,801,792stderr
4Aug 30, 2026 22:581,581245,849,680233,103,0004,167,00016,801,792stderr
5Aug 30, 2026 22:581,581248,826,913232,974,0004,291,00016,801,792stderr
6Aug 30, 2026 22:581,581245,807,996233,099,0004,190,00016,801,792stderr
7Aug 30, 2026 22:581,582245,851,827233,224,0004,180,00016,801,792stderr
8Aug 30, 2026 22:581,583245,956,056233,387,0004,164,00016,801,792stderr
9Aug 30, 2026 22:581,583245,993,335233,404,0004,157,00016,801,792stderr