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 08:58Victor MerckléVictor MerckléScore: 1,623Success
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 08:591,621253,054,490235,390,0007,828,00016,801,792stderr
2Aug 27, 2026 08:591,621253,104,071235,479,0007,801,00016,801,792stderr
3Aug 27, 2026 08:591,622253,227,220235,380,0007,932,00016,801,792stderr
4Aug 27, 2026 08:591,622253,278,848235,452,0007,909,00016,801,792stderr
5Aug 27, 2026 08:591,623253,391,894235,601,0007,910,00016,801,792stderr
6Aug 27, 2026 08:591,623253,403,861235,639,0007,917,00016,801,792stderr
7Aug 27, 2026 08:591,626253,808,311235,930,0007,979,00016,801,792stderr
8Aug 27, 2026 08:591,627254,052,956236,083,0007,984,00016,801,792stderr
9Aug 27, 2026 08:591,628254,735,935236,273,0007,989,00016,801,792stderr