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:45marko1597marko1597Score: 2,469Success
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 05:062,467380,173,302364,900,0005,272,00016,801,792stderr
2Aug 17, 2026 05:062,467380,150,468364,735,0005,379,00016,801,792stderr
3Aug 17, 2026 05:062,467380,813,065364,758,0005,400,00016,801,792stderr
4Aug 17, 2026 05:062,468380,302,954364,940,0005,296,00016,801,792stderr
5Aug 17, 2026 05:062,469381,144,771365,171,0005,265,00016,801,792stderr
6Aug 17, 2026 05:062,472381,688,517365,551,0005,254,00016,801,792stderr
7Aug 17, 2026 05:062,475381,240,312365,998,0005,275,00016,801,792stderr
8Aug 17, 2026 05:062,478383,409,606365,378,0006,376,00016,801,792stderr
9Aug 17, 2026 05:062,509399,046,901370,942,0005,439,00016,801,792stderr