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 listJul 29, 2026 21:20anboto1anboto1Score: 3,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 21:213,379517,566,163476,993,00029,935,00016,793,600
2Jul 29, 2026 21:213,382517,356,227477,054,00030,379,00016,793,600
3Jul 29, 2026 21:213,392518,830,126478,507,00030,354,00016,793,600
4Jul 29, 2026 21:213,396519,317,535478,973,00030,455,00016,793,600
5Jul 29, 2026 21:213,399519,861,119479,678,00030,283,00016,793,600
6Jul 29, 2026 21:213,416522,446,819482,334,00030,098,00016,793,600
7Jul 29, 2026 21:213,436525,500,977485,620,00029,899,00016,793,600
8Jul 29, 2026 21:213,454528,118,933487,984,00030,150,00016,793,600
9Jul 29, 2026 21:213,476541,245,344491,436,00029,993,00016,793,600