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 listJun 21, 2026 18:11A_ShamanA_ShamanScore: 4,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 18:114,176635,847,948596,178,00030,351,00016,797,696
2Jun 21, 2026 18:114,178636,404,542596,306,00030,402,00016,793,600
3Jun 21, 2026 18:114,180637,600,943596,333,00030,743,00016,797,696
4Jun 21, 2026 18:114,180636,733,379596,453,00030,624,00016,793,600
5Jun 21, 2026 18:114,197639,412,795599,931,00029,689,00016,797,696
6Jun 21, 2026 18:114,211641,496,514601,074,00030,628,00016,793,600
7Jun 21, 2026 18:114,225643,112,228602,756,00031,021,00016,793,600
8Jun 21, 2026 18:114,262648,939,193608,626,00030,782,00016,793,600
9Jun 21, 2026 18:114,275651,769,672610,515,00030,877,00016,797,696