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 15, 2026 00:38Tomislav TunkovicTomislav TunkovicScore: 1,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 00:391,750272,526,108254,714,0007,809,00016,801,792stderr
2Aug 15, 2026 00:391,750272,695,242254,868,0007,759,00016,801,792stderr
3Aug 15, 2026 00:391,753272,969,590255,189,0007,804,00016,801,792stderr
4Aug 15, 2026 00:391,753273,825,688255,300,0007,782,00016,801,792stderr
5Aug 15, 2026 00:391,753273,004,021255,144,0007,876,00016,801,792stderr
6Aug 15, 2026 00:391,754273,133,640255,183,0007,932,00016,801,792stderr
7Aug 15, 2026 00:391,754273,958,505255,458,0007,741,00016,801,792stderr
8Aug 15, 2026 00:391,756273,618,513255,625,0007,778,00016,801,792stderr
9Aug 15, 2026 00:391,756274,426,960255,679,0007,836,00016,801,792stderr