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:56anboto1anboto1Score: 3,066Success
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:053,055468,984,758442,859,00015,528,00016,793,600
2Jul 30, 2026 00:053,060470,743,508443,934,00015,210,00016,793,600
3Jul 30, 2026 00:053,060469,637,752443,651,00015,396,00016,793,600
4Jul 30, 2026 00:053,062469,247,112444,298,00015,126,00016,793,600
5Jul 30, 2026 00:053,066470,074,220444,937,00015,002,00016,793,600
6Jul 30, 2026 00:053,067470,390,326445,127,00014,952,00016,793,600
7Jul 30, 2026 00:053,067470,133,273444,834,00015,334,00016,793,600
8Jul 30, 2026 00:053,068470,121,460445,079,00015,207,00016,793,600
9Jul 30, 2026 00:053,069470,303,078445,110,00015,258,00016,793,600