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 listAug 12, 2025 01:03SergeBouSergeBouScore: 61,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 01:0361,2989,235,651,1529,145,756,00048,945,00017,211,392
2Aug 12, 2025 01:0361,3859,246,322,7539,164,810,00042,952,00017,178,624
3Aug 12, 2025 01:0361,3999,249,120,0189,160,917,00048,935,00017,227,776
4Aug 12, 2025 01:0361,4069,247,735,8619,172,952,00037,950,00017,190,912
5Aug 12, 2025 01:0361,4149,257,632,9309,169,149,00042,944,00017,100,800
6Aug 12, 2025 01:0361,4269,256,683,3899,171,912,00041,944,00017,182,720
7Aug 12, 2025 01:0361,4309,258,873,8909,156,569,00057,921,00017,100,800
8Aug 12, 2025 01:0361,4499,259,553,6339,168,399,00048,938,00017,219,584
9Aug 12, 2025 01:0361,5129,266,450,9339,179,927,00046,933,00017,186,816