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 20:51anboto1anboto1Score: 3,340Success
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 20:513,337510,448,790487,766,00012,874,00016,793,600
2Jul 29, 2026 20:513,337510,718,657487,737,00012,897,00016,793,600
3Jul 29, 2026 20:513,338510,774,641487,701,00013,019,00016,793,600
4Jul 29, 2026 20:513,340511,059,997488,157,00012,956,00016,793,600
5Jul 29, 2026 20:513,340511,081,774488,169,00012,922,00016,793,600
6Jul 29, 2026 20:513,341511,289,185488,201,00013,066,00016,793,600
7Jul 29, 2026 20:513,341511,342,491488,118,00013,065,00016,793,600
8Jul 29, 2026 20:513,343511,693,897488,534,00013,012,00016,793,600
9Jul 29, 2026 20:513,343511,574,975488,504,00013,067,00016,793,600