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 27, 2026 12:41Victor MerckléVictor MerckléScore: 3,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:423,991608,642,439590,748,0007,986,00016,801,792stderr
2Aug 27, 2026 12:423,991608,758,938590,764,0007,984,00016,801,792stderr
3Aug 27, 2026 12:423,992609,528,211590,965,0007,952,00016,801,792stderr
4Aug 27, 2026 12:423,993608,890,975591,031,0007,931,00016,801,792stderr
5Aug 27, 2026 12:423,994609,194,430591,229,0007,923,00016,801,792stderr
6Aug 27, 2026 12:423,994609,030,612591,039,0008,069,00016,801,792stderr
7Aug 27, 2026 12:423,998609,683,229591,782,0008,016,00016,801,792stderr
8Aug 27, 2026 12:423,998609,701,891591,733,0008,009,00016,801,792stderr
9Aug 27, 2026 12:423,998609,854,540591,815,0007,977,00016,801,792stderr