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 28, 2026 09:27TudyMTudyMScore: 5,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:285,313817,853,535781,096,00016,001,00016,973,824
2Apr 28, 2026 09:285,320821,333,590781,093,00017,002,00016,973,824
3Apr 28, 2026 09:285,326822,437,455785,008,00013,982,00016,977,920
4Apr 28, 2026 09:285,326816,511,387783,992,00014,999,00017,125,376
5Apr 28, 2026 09:285,329816,814,361778,375,00020,983,00016,973,824
6Apr 28, 2026 09:285,329815,923,437782,416,00016,987,00017,162,240
7Apr 28, 2026 09:285,330825,171,085782,561,00016,990,00016,982,016
8Apr 28, 2026 09:285,344817,787,357788,668,00012,994,00017,055,744
9Apr 28, 2026 09:285,351817,343,390785,683,00016,993,00017,145,856