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 09:09Tomislav TunkovicTomislav TunkovicScore: 2,022Success
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 09:092,018313,186,884286,667,00016,139,00016,801,792stderr
2Aug 11, 2026 09:092,020313,029,808286,966,00016,051,00016,801,792stderr
3Aug 11, 2026 09:092,022313,408,663287,247,00016,132,00016,801,792stderr
4Aug 11, 2026 09:092,022313,586,992287,215,00016,226,00016,801,792stderr
5Aug 11, 2026 09:092,022313,398,008287,076,00016,301,00016,801,792stderr
6Aug 11, 2026 09:092,023313,579,616287,211,00016,382,00016,801,792stderr
7Aug 11, 2026 09:092,023313,565,454287,317,00016,158,00016,801,792stderr
8Aug 11, 2026 09:092,024313,701,498287,407,00016,275,00016,801,792stderr
9Aug 11, 2026 09:092,025314,499,247287,471,00016,324,00016,801,792stderr