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 listJun 24, 2026 09:07anboto1anboto1Score: 22,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:0821,9003,294,278,5403,257,945,00027,140,00016,793,600
2Jun 24, 2026 09:0821,9763,305,717,5543,268,873,00027,590,00016,793,600
3Jun 24, 2026 09:0821,9823,306,767,0683,269,913,00027,518,00016,793,600
4Jun 24, 2026 09:0822,0953,323,642,9593,286,980,00027,385,00016,793,600
5Jun 24, 2026 09:0822,0983,323,986,6063,287,660,00027,086,00016,793,600
6Jun 24, 2026 09:0822,1573,332,911,6093,296,097,00027,519,00016,793,600
7Jun 24, 2026 09:0822,2223,342,586,4263,305,856,00027,481,00016,793,600
8Jun 24, 2026 09:0822,2393,345,095,4223,308,595,00027,283,00016,793,600
9Jun 24, 2026 09:0825,3913,818,199,2953,781,318,00027,393,00016,793,600