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 23:14anboto1anboto1Score: 2,893Success
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 23:152,891443,848,100420,318,00013,471,00016,793,600
2Jul 29, 2026 23:152,892443,900,037420,471,00013,411,00016,793,600
3Jul 29, 2026 23:152,893443,916,999420,604,00013,382,00016,793,600
4Jul 29, 2026 23:152,893444,072,438420,672,00013,376,00016,793,600
5Jul 29, 2026 23:152,893444,151,797420,593,00013,463,00016,793,600
6Jul 29, 2026 23:152,894444,208,033420,774,00013,472,00016,793,600
7Jul 29, 2026 23:152,897444,607,592421,239,00013,397,00016,793,600
8Jul 29, 2026 23:152,897444,755,369421,152,00013,472,00016,793,600
9Jul 29, 2026 23:152,900445,114,430421,460,00013,557,00016,793,600