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 19, 2026 17:16Dominique GarmierDominique GarmierScore: 7,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 17:057,0111,083,516,6161,022,750,00028,936,00016,961,536
2Mar 19, 2026 17:077,0171,083,286,6221,022,623,00029,930,00016,994,304
3Mar 19, 2026 17:077,0341,083,413,3551,026,105,00028,946,00017,076,224
4Mar 19, 2026 17:057,0381,085,182,4441,024,766,00030,932,00017,051,648
5Mar 19, 2026 17:167,0431,090,059,9051,020,555,00035,913,00017,051,648
6Mar 19, 2026 17:167,0931,099,228,3261,032,004,00031,938,00016,953,344
7Mar 19, 2026 17:077,1051,094,700,2891,029,786,00035,922,00017,051,648
8Mar 19, 2026 17:167,1121,095,254,8001,033,818,00032,930,00017,047,552
9Mar 19, 2026 17:057,1251,098,924,0271,037,784,00030,933,00017,051,648