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 17:15anboto1anboto1Score: 2,595Success
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 17:162,594399,207,442378,747,00010,360,00016,793,600
2Jul 29, 2026 17:162,594399,155,374378,749,00010,363,00016,793,600
3Jul 29, 2026 17:162,595399,562,763378,952,00010,403,00016,793,600
4Jul 29, 2026 17:162,595399,291,155378,904,00010,452,00016,793,600
5Jul 29, 2026 17:162,595399,461,195378,919,00010,418,00016,793,600
6Jul 29, 2026 17:162,597399,822,239379,288,00010,383,00016,793,600
7Jul 29, 2026 17:162,599400,369,548379,446,00010,465,00016,793,600
8Jul 29, 2026 17:162,600400,112,852379,558,00010,480,00016,793,600
9Jul 29, 2026 17:162,601400,371,221379,671,00010,546,00016,793,600