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 listSep 4, 2026 05:55C#_userC#_userScore: 381,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:10380,52357,089,297,41157,029,277,00049,199,00016,793,600
2Sep 4, 2026 06:10380,65957,109,891,34557,051,822,00047,147,00016,793,600
3Sep 4, 2026 06:10380,66757,112,570,76357,050,292,00049,903,00016,793,600
4Sep 4, 2026 06:10380,83757,137,157,64257,077,327,00048,364,00016,793,600
5Sep 4, 2026 06:10381,34357,212,226,17357,153,481,00047,976,00016,793,600
6Sep 4, 2026 06:10381,54857,243,136,83257,183,679,00048,559,00016,793,600
7Sep 4, 2026 06:10382,28257,353,931,13957,294,387,00047,934,00016,793,600
8Sep 4, 2026 06:10382,98557,458,713,71757,398,500,00049,255,00016,793,600
9Sep 4, 2026 06:10383,60057,550,829,72157,490,311,00049,786,00016,793,600