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:59Victor MerckléVictor MerckléScore: 1,986Success
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 13:001,983307,966,552289,481,0008,032,00016,801,792stderr
2Aug 27, 2026 13:001,984307,534,131289,521,0008,086,00016,801,792stderr
3Aug 27, 2026 13:001,986307,941,545290,071,0007,922,00016,801,792stderr
4Aug 27, 2026 13:001,986307,895,843289,997,0008,002,00016,801,792stderr
5Aug 27, 2026 13:001,986307,939,145290,021,0007,948,00016,801,792stderr
6Aug 27, 2026 13:001,988308,161,563290,260,0007,970,00016,801,792stderr
7Aug 27, 2026 13:001,989309,834,688290,463,0007,963,00016,801,792stderr
8Aug 27, 2026 13:001,990308,527,740290,562,0008,013,00016,801,792stderr
9Aug 27, 2026 13:001,996309,332,573291,431,0007,996,00016,801,792stderr