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 00:38SergeBouSergeBouScore: 61,409Success
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 00:3861,3039,235,411,6779,157,497,00037,956,00017,182,720
2Aug 12, 2025 00:3861,3359,242,628,5469,164,225,00035,953,00017,133,568
3Aug 12, 2025 00:3861,3419,235,487,4799,163,144,00037,950,00017,174,528
4Aug 12, 2025 00:3861,3959,247,885,2499,170,318,00038,950,00017,178,624
5Aug 12, 2025 00:3861,4099,246,844,7809,171,420,00039,949,00017,174,528
6Aug 12, 2025 00:3861,4129,249,343,5929,170,816,00040,945,00017,080,320
7Aug 12, 2025 00:3861,4189,251,255,4339,173,742,00038,947,00017,055,744
8Aug 12, 2025 00:3861,4249,256,642,4149,171,702,00041,943,00017,051,648
9Aug 12, 2025 00:3861,5279,274,333,5049,189,151,00039,948,00017,190,912