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 listJun 24, 2026 10:19anboto1anboto1Score: 5,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:195,283801,734,768770,157,00022,318,00016,793,600
2Jun 24, 2026 10:195,288802,614,988770,912,00022,436,00016,793,600
3Jun 24, 2026 10:195,305805,021,201773,434,00022,413,00016,793,600
4Jun 24, 2026 10:195,309805,696,170773,712,00022,676,00016,793,600
5Jun 24, 2026 10:195,322807,635,487776,146,00022,220,00016,793,600
6Jun 24, 2026 10:195,337809,771,429778,008,00022,631,00016,793,600
7Jun 24, 2026 10:195,441826,061,109794,829,00021,460,00016,793,600
8Jun 24, 2026 10:195,521838,237,291807,545,00020,709,00016,793,600
9Jun 24, 2026 10:195,659858,102,803826,462,00022,491,00016,793,600