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 19, 2026 15:15Victor MerckléVictor MerckléScore: 1,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:171,636255,382,874237,571,0007,902,00016,801,792stderr
2Aug 19, 2026 15:171,637255,637,564237,658,0008,012,00016,801,792stderr
3Aug 19, 2026 15:171,637255,543,955237,583,0008,091,00016,801,792stderr
4Aug 19, 2026 15:171,637255,654,175237,706,0007,965,00016,801,792stderr
5Aug 19, 2026 15:171,637255,573,537237,745,0007,910,00016,801,792stderr
6Aug 19, 2026 15:171,638255,834,796237,593,0008,118,00016,801,792stderr
7Aug 19, 2026 15:171,641256,027,345238,210,0007,977,00016,801,792stderr
8Aug 19, 2026 15:171,642256,312,538238,262,0008,090,00016,801,792stderr
9Aug 19, 2026 15:171,644256,848,516238,499,0008,108,00016,801,792stderr