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 listApr 16, 2026 17:18Jasper EdbrookeJasper EdbrookeScore: 375,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 17:18371,76355,850,140,38955,689,483,00074,946,00017,051,648
2Apr 16, 2026 17:18373,55256,102,074,73655,985,867,00046,968,00017,178,624
3Apr 16, 2026 17:18374,89956,299,106,18256,182,809,00051,968,00017,051,648
4Apr 16, 2026 17:18374,97956,307,812,01856,194,840,00051,967,00017,219,584
5Apr 16, 2026 17:18375,12456,333,128,18456,205,578,00062,955,00017,178,624
6Apr 16, 2026 17:18376,11356,478,046,92256,362,040,00054,964,00016,965,632
7Apr 16, 2026 17:18376,40856,516,069,10856,403,202,00057,967,00017,084,416
8Apr 16, 2026 17:18378,45956,825,876,05756,704,874,00063,959,00017,174,528
9Apr 16, 2026 17:18380,57557,150,659,93957,024,304,00061,963,00016,965,632