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 listOct 21, 2026 00:36e1011e1011Score: 63,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 00:3862,6569,409,704,3029,393,015,0005,505,00016,793,600
2Oct 21, 2026 00:3862,8019,431,051,7839,415,810,0004,372,00016,793,600
3Oct 21, 2026 00:3862,9679,456,504,5139,440,522,0004,605,00016,793,600
4Oct 21, 2026 00:3863,0159,467,347,2279,447,863,0004,455,00016,793,600
5Oct 21, 2026 00:3863,0409,467,222,1989,450,685,0005,433,00016,793,600
6Oct 21, 2026 00:3863,1519,483,658,5599,468,289,0004,430,00016,793,600
7Oct 21, 2026 00:3863,2879,504,338,9329,487,916,0005,145,00016,793,600
8Oct 21, 2026 00:3863,3319,510,533,7869,495,379,0004,340,00016,793,600
9Oct 21, 2026 00:3863,5679,546,136,1589,530,865,0004,331,00016,793,600