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 30, 2026 00:07anboto1anboto1Score: 3,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:143,046466,959,233441,825,00015,172,00016,793,600
2Jul 30, 2026 00:143,048467,351,625441,739,00015,609,00016,793,600
3Jul 30, 2026 00:143,050467,712,742442,293,00015,277,00016,793,600
4Jul 30, 2026 00:143,052467,718,762442,048,00015,806,00016,793,600
5Jul 30, 2026 00:143,053467,915,081442,672,00015,303,00016,793,600
6Jul 30, 2026 00:143,054469,478,885442,519,00015,607,00016,793,600
7Jul 30, 2026 00:143,055468,357,518443,004,00015,348,00016,793,600
8Jul 30, 2026 00:143,057468,745,659443,235,00015,422,00016,793,600
9Jul 30, 2026 00:143,062469,470,032444,078,00015,301,00016,793,600