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:57anboto1anboto1Score: 3,437Success
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:573,401520,331,605489,022,00021,223,00016,793,600
2Jul 29, 2026 21:573,404520,645,729489,345,00021,288,00016,793,600
3Jul 29, 2026 21:573,420523,019,343491,075,00021,996,00016,793,600
4Jul 29, 2026 21:573,430524,576,620492,213,00022,333,00016,793,600
5Jul 29, 2026 21:573,437525,693,451493,310,00022,346,00016,793,600
6Jul 29, 2026 21:573,441526,351,208493,668,00022,571,00016,793,600
7Jul 29, 2026 21:573,447527,076,159495,774,00021,316,00016,793,600
8Jul 29, 2026 21:573,456528,515,919496,135,00022,404,00016,793,600
9Jul 29, 2026 21:573,472530,956,994499,100,00021,789,00016,793,600