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 listSep 21, 2026 16:08Andrew EpsteinAndrew EpsteinScore: 6,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:096,536990,819,055958,508,00021,986,00016,801,792stderr
2Sep 21, 2026 16:096,536990,848,373958,360,00022,174,00016,801,792stderr
3Sep 21, 2026 16:096,539991,103,188958,809,00022,044,00016,801,792stderr
4Sep 21, 2026 16:096,539991,386,857958,873,00022,076,00016,797,696stderr
5Sep 21, 2026 16:096,541992,831,129958,386,00022,845,00016,801,792stderr
6Sep 21, 2026 16:096,545992,525,202958,607,00023,195,00016,801,792stderr
7Sep 21, 2026 16:096,549992,687,754960,195,00022,226,00016,797,696stderr
8Sep 21, 2026 16:096,555993,610,594961,170,00022,200,00016,801,792stderr
9Sep 21, 2026 16:096,557994,558,205961,034,00022,560,00016,801,792stderr