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 listMar 21, 2026 21:31Yuriy LyfenkoYuriy LyfenkoScore: 13,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2024 22:2013,6762,079,807,9682,029,385,00021,993,00016,961,536
2Aug 31, 2024 22:2013,6782,076,250,5992,029,719,00021,986,00017,100,800
3Mar 21, 2026 21:3113,6822,073,060,0222,028,332,00023,992,00017,190,912
4Mar 21, 2026 21:3113,6832,080,154,6822,028,436,00023,993,00017,084,416
5Aug 31, 2024 22:2013,6842,082,672,7332,032,583,00019,995,00016,961,536
6Mar 21, 2026 21:3113,6842,078,571,4822,031,539,00020,995,00016,961,536