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 05:23e1011e1011Score: 16,109Success
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 05:2316,0992,426,253,5332,399,234,00015,688,00016,793,600
2Oct 21, 2026 05:2316,1012,426,083,1712,399,648,00015,593,00016,793,600
3Oct 21, 2026 05:2316,1072,426,952,2162,399,957,00016,116,00016,793,600
4Oct 21, 2026 05:2316,1072,427,005,0142,400,061,00016,086,00016,793,600
5Oct 21, 2026 05:2316,1092,427,209,0952,400,218,00016,149,00016,793,600
6Oct 21, 2026 05:2316,1162,428,351,6382,401,339,00016,186,00016,793,600
7Oct 21, 2026 05:2316,1212,436,385,4022,401,988,00016,241,00016,793,600
8Oct 21, 2026 05:2316,1312,430,568,8372,403,492,00016,269,00016,793,600
9Oct 21, 2026 05:2316,2152,443,152,2262,416,505,00015,826,00016,793,600