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 listApr 26, 2026 14:15Victor MerckléVictor MerckléScore: 3,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:153,090484,797,254453,552,0009,990,00017,010,688
2Apr 26, 2026 14:153,092480,996,769453,900,0009,997,00017,006,592
3Apr 26, 2026 14:153,093481,292,263456,081,0008,001,00017,002,496
4Apr 26, 2026 14:153,093477,230,263457,985,0005,999,00017,031,168
5Apr 26, 2026 14:153,094476,555,441456,100,0008,001,00017,006,592
6Apr 26, 2026 14:153,094485,640,236458,224,0006,002,00017,006,592
7Apr 26, 2026 14:153,095482,991,321457,336,0006,989,00017,006,592
8Apr 26, 2026 14:153,096482,420,793455,450,0008,989,00017,051,648
9Apr 26, 2026 14:153,097485,193,671457,557,0006,993,00016,998,400