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 26, 2026 18:22TudyMTudyMScore: 12,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:2212,4401,890,020,3581,836,193,00029,937,00017,010,688
2Apr 26, 2026 18:2212,5171,900,440,9251,842,675,00034,936,00017,084,416
3Apr 26, 2026 18:2212,5341,901,455,6101,847,308,00032,934,00017,002,496
4Apr 26, 2026 18:2212,5391,897,551,1341,850,926,00029,934,00017,092,608
5Apr 26, 2026 18:2212,6351,915,152,1081,857,448,00037,927,00016,998,400
6Apr 26, 2026 18:2212,6431,919,949,7291,864,527,00031,923,00017,002,496
7Apr 26, 2026 18:2212,7101,928,046,5831,875,702,00030,945,00016,998,400
8Apr 26, 2026 18:2212,8701,950,857,6581,898,664,00031,927,00017,002,496
9Apr 26, 2026 18:2213,8142,090,690,5572,042,231,00029,930,00017,010,688