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 listApr 28, 2026 08:20TudyMTudyMScore: 20,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:2117,6472,669,256,0492,620,160,00026,960,00017,149,952
2Apr 28, 2026 08:2119,3442,927,356,1782,871,663,00029,954,00017,190,912
3Apr 28, 2026 08:2119,8122,994,848,0262,943,957,00027,961,00017,195,008
4Apr 28, 2026 08:2120,4223,094,440,6983,031,434,00031,951,00017,190,912
5Apr 28, 2026 08:2120,7933,140,713,3203,086,104,00032,947,00017,133,568
6Apr 28, 2026 08:2121,3963,236,498,0643,180,542,00028,959,00017,137,664
7Apr 28, 2026 08:2123,2393,506,375,9023,460,905,00024,977,00017,195,008
8Apr 28, 2026 08:2123,5243,550,996,3273,501,727,00026,982,00017,002,496
9Apr 28, 2026 08:2123,5573,552,744,2143,508,596,00024,982,00017,186,816