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 22:49anboto1anboto1Score: 3,060Success
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 22:503,050467,939,511442,705,00014,918,00016,793,600
2Jul 29, 2026 22:503,051467,904,373442,528,00015,260,00016,793,600
3Jul 29, 2026 22:503,057468,869,290443,639,00015,054,00016,793,600
4Jul 29, 2026 22:503,060469,131,634443,974,00015,132,00016,793,600
5Jul 29, 2026 22:503,060469,333,360443,978,00015,171,00016,793,600
6Jul 29, 2026 22:503,063469,475,355444,561,00015,015,00016,793,600
7Jul 29, 2026 22:503,064469,610,505444,727,00014,957,00016,793,600
8Jul 29, 2026 22:503,069470,278,898445,220,00015,162,00016,793,600
9Jul 29, 2026 22:503,070470,456,115445,496,00015,025,00016,793,600