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:44e1011e1011Score: 63,300Success
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:4662,5959,400,481,6389,364,005,00025,253,00016,793,600
2Oct 21, 2026 00:4662,6209,404,557,4119,368,257,00024,784,00016,793,600
3Oct 21, 2026 00:4662,9969,460,844,4099,424,139,00025,402,00016,793,600
4Oct 21, 2026 00:4663,1489,483,153,9569,446,855,00025,400,00016,793,600
5Oct 21, 2026 00:4663,3009,505,964,6649,471,396,00023,671,00016,793,600
6Oct 21, 2026 00:4663,3399,512,217,7099,477,044,00023,867,00016,793,600
7Oct 21, 2026 00:4663,8609,590,090,4659,553,600,00025,428,00016,793,600
8Oct 21, 2026 00:4663,8899,594,428,5079,559,523,00023,971,00016,793,600
9Oct 21, 2026 00:4664,1759,637,282,0619,601,474,00024,792,00016,793,600