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 11, 2026 10:01Tomislav TunkovicTomislav TunkovicScore: 1,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 10:021,920298,738,091278,994,0009,075,00016,801,792stderr
2Aug 11, 2026 10:021,920298,062,257279,067,0009,068,00016,801,792stderr
3Aug 11, 2026 10:021,921298,929,131279,059,0009,111,00016,801,792stderr
4Aug 11, 2026 10:021,921298,393,194279,109,0009,138,00016,801,792stderr
5Aug 11, 2026 10:021,923298,547,070279,410,0009,129,00016,801,792stderr
6Aug 11, 2026 10:021,923298,637,738279,262,0009,259,00016,801,792stderr
7Aug 11, 2026 10:021,923299,219,197279,156,0009,333,00016,801,792stderr
8Aug 11, 2026 10:021,924299,411,535279,584,0009,152,00016,801,792stderr
9Aug 11, 2026 10:021,925298,852,800279,620,0009,248,00016,801,792stderr