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 listMay 16, 2026 17:56M-RochatM-RochatScore: 4,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 17:574,269650,522,884619,301,00021,112,00016,793,600
2May 16, 2026 17:574,270649,684,762619,405,00021,227,00016,793,600
3May 16, 2026 17:574,273649,748,122619,796,00021,207,00016,793,600
4May 16, 2026 17:574,276653,296,167620,360,00021,125,00016,793,600
5May 16, 2026 17:574,276653,337,136618,671,00022,875,00016,793,600
6May 16, 2026 17:574,277650,448,696620,099,00021,499,00016,793,600
7May 16, 2026 17:574,281652,589,065620,110,00022,145,00016,793,600
8May 16, 2026 17:574,282653,473,504621,174,00021,269,00016,793,600
9May 16, 2026 17:574,285651,679,310621,078,00021,688,00016,793,600