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 19, 2026 15:18Victor MerckléVictor MerckléScore: 1,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:191,636255,392,513237,578,0007,877,00016,801,792stderr
2Aug 19, 2026 15:191,637255,505,165237,647,0007,907,00016,801,792stderr
3Aug 19, 2026 15:191,638255,621,183237,742,0007,978,00016,801,792stderr
4Aug 19, 2026 15:191,639255,874,380237,703,0008,223,00016,801,792stderr
5Aug 19, 2026 15:191,639255,859,553238,011,0007,930,00016,801,792stderr
6Aug 19, 2026 15:191,639255,975,320237,845,0008,126,00016,801,792stderr
7Aug 19, 2026 15:191,640256,180,799238,066,0008,029,00016,801,792stderr
8Aug 19, 2026 15:191,640256,042,743238,126,0007,997,00016,801,792stderr
9Aug 19, 2026 15:191,642256,311,186238,318,0008,021,00016,801,792stderr