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 11:07limanjun99limanjun99Score: 12,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 11:0712,1691,855,367,1781,795,474,00029,924,00017,092,608
2Mar 21, 2026 11:0712,2031,861,931,8331,800,477,00029,924,00017,207,296
3Mar 21, 2026 11:0712,2571,866,101,8351,810,554,00027,931,00017,154,048
4Mar 21, 2026 11:0712,4321,897,226,5251,828,916,00035,919,00017,051,648
5Mar 21, 2026 11:0712,4441,895,498,0581,836,607,00029,928,00017,018,880
6Mar 21, 2026 11:0712,5661,910,387,1451,842,035,00042,907,00017,031,168
7Mar 21, 2026 11:0712,6281,923,377,9411,853,242,00040,895,00017,100,800
8Mar 21, 2026 11:0713,6372,076,485,7082,012,673,00032,929,00017,068,032
9Mar 21, 2026 11:0713,7172,083,756,2632,026,564,00030,932,00017,108,992