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 01:24e1011e1011Score: 24,382Success
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 01:2824,3123,657,766,8743,621,358,00025,455,00016,793,600
2Oct 21, 2026 01:2824,3513,663,593,6783,628,258,00024,404,00016,793,600
3Oct 21, 2026 01:2824,3763,667,406,3173,630,580,00025,901,00016,793,600
4Oct 21, 2026 01:2824,3773,667,699,1773,630,977,00025,684,00016,793,600
5Oct 21, 2026 01:2824,3823,668,267,9483,631,671,00025,685,00016,793,600
6Oct 21, 2026 01:2824,4133,672,774,7023,637,712,00024,324,00016,793,600
7Oct 21, 2026 01:2824,4193,673,635,5963,637,081,00025,797,00016,793,600
8Oct 21, 2026 01:2824,4553,679,642,3743,640,568,00027,754,00016,793,600
9Oct 21, 2026 01:2824,4893,684,228,1213,649,841,00023,518,00016,793,600