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 listJan 5, 2026 05:32Josu San MartinJosu San MartinScore: 3,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 04:533,221515,322,590448,095,00035,007,00017,174,528
2Jan 5, 2026 04:533,221512,894,585453,144,00030,009,00017,051,648
3Jan 5, 2026 05:323,254517,348,457458,118,00030,007,00017,043,456
4Jan 5, 2026 04:533,296524,756,860467,461,00026,968,00016,961,536
5Jan 5, 2026 05:323,310528,710,115466,505,00029,968,00016,957,440
6Jan 5, 2026 05:323,316527,355,462470,480,00026,970,00016,969,728