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 16:51anboto1anboto1Score: 2,800Success
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 16:522,797429,750,159405,134,00014,517,00016,793,600
2Jul 29, 2026 16:522,798430,011,700405,132,00014,597,00016,793,600
3Jul 29, 2026 16:522,800430,131,652405,672,00014,416,00016,793,600
4Jul 29, 2026 16:522,800430,101,813405,489,00014,625,00016,793,600
5Jul 29, 2026 16:522,800430,023,468405,670,00014,445,00016,793,600
6Jul 29, 2026 16:522,801430,252,416405,692,00014,485,00016,793,600
7Jul 29, 2026 16:522,802430,361,585405,949,00014,490,00016,793,600
8Jul 29, 2026 16:522,805431,980,280406,133,00014,635,00016,793,600
9Jul 29, 2026 16:522,805430,767,664406,248,00014,627,00016,793,600