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 19:03anboto1anboto1Score: 2,789Success
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 19:032,780427,073,400403,857,00013,259,00016,793,600
2Jul 29, 2026 19:032,783427,821,429404,372,00013,114,00016,793,600
3Jul 29, 2026 19:032,786427,987,986404,645,00013,308,00016,793,600
4Jul 29, 2026 19:032,788428,836,195404,967,00013,239,00016,793,600
5Jul 29, 2026 19:032,789428,371,304405,208,00013,273,00016,793,600
6Jul 29, 2026 19:032,795429,308,801405,827,00013,501,00016,793,600
7Jul 29, 2026 19:032,796429,443,185405,965,00013,448,00016,793,600
8Jul 29, 2026 19:032,803430,633,343407,065,00013,528,00016,793,600
9Jul 29, 2026 19:032,809431,620,340408,213,00013,282,00016,793,600