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 17, 2026 04:26marko1597marko1597Score: 2,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:412,445376,797,409361,376,0005,385,00016,801,792stderr
2Aug 17, 2026 04:412,447377,951,549361,854,0005,231,00016,801,792stderr
3Aug 17, 2026 04:412,447377,127,853361,863,0005,270,00016,801,792stderr
4Aug 17, 2026 04:412,448377,968,875361,959,0005,265,00016,801,792stderr
5Aug 17, 2026 04:412,448377,273,314362,083,0005,266,00016,801,792stderr
6Aug 17, 2026 04:412,448377,347,456362,000,0005,260,00016,801,792stderr
7Aug 17, 2026 04:412,452377,826,496362,649,0005,266,00016,801,792stderr
8Aug 17, 2026 04:412,452378,618,522362,573,0005,249,00016,801,792stderr
9Aug 17, 2026 04:412,454384,446,754362,838,0005,307,00016,801,792stderr