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:32Andrew EpsteinAndrew EpsteinScore: 6,638Success
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:326,6341,005,662,766973,261,00021,909,00016,801,792stderr
2Sep 21, 2026 16:326,6371,006,678,069973,528,00022,098,00016,801,792stderr
3Sep 21, 2026 16:326,6371,005,977,411973,536,00022,065,00016,801,792stderr
4Sep 21, 2026 16:326,6381,006,116,913973,663,00022,048,00016,801,792stderr
5Sep 21, 2026 16:326,6381,006,217,671973,686,00022,134,00016,801,792stderr
6Sep 21, 2026 16:326,6401,006,607,594973,494,00022,562,00016,801,792stderr
7Sep 21, 2026 16:326,6551,008,941,564975,934,00022,330,00016,801,792stderr
8Sep 21, 2026 16:326,6561,008,786,358976,148,00022,368,00016,797,696stderr
9Sep 21, 2026 16:326,6581,009,207,850976,415,00022,338,00016,801,792stderr