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 listApr 20, 2026 20:24Charles CabergsCharles CabergsScore: 4,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 20:274,010615,576,051592,613,0008,994,00016,953,344
2Apr 20, 2026 20:274,023626,708,895594,506,0008,992,00016,953,344
3Apr 20, 2026 20:274,050631,217,932597,648,0009,994,00016,953,344
4Apr 20, 2026 20:274,056633,037,499599,554,0008,993,00016,945,152
5Apr 20, 2026 20:274,057638,542,885599,576,0008,993,00016,957,440
6Apr 20, 2026 20:274,060636,209,043600,000,0009,000,00016,936,960
7Apr 20, 2026 20:274,063631,594,728600,512,0008,992,00016,953,344
8Apr 20, 2026 20:274,069639,530,563600,366,0009,989,00016,961,536
9Apr 20, 2026 20:274,077632,284,039600,672,00010,994,00016,936,960