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 29, 2026 11:18Dominique GarmierDominique GarmierScore: 3,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 11:193,270504,955,793468,577,00021,980,00017,141,760
2Apr 29, 2026 11:193,273507,319,623464,024,00027,001,00016,990,208
3Apr 29, 2026 11:193,276512,914,892463,478,00027,968,00017,141,760
4Apr 29, 2026 11:193,278512,169,293467,760,00023,987,00017,149,952
5Apr 29, 2026 11:193,281513,683,907461,268,00031,018,00017,084,416
6Apr 29, 2026 11:193,282512,705,364465,391,00026,964,00017,137,664
7Apr 29, 2026 11:193,283512,350,543465,577,00026,975,00017,141,760
8Apr 29, 2026 11:193,286513,449,910467,914,00024,995,00017,141,760
9Apr 29, 2026 11:193,289520,059,588475,504,00017,981,00017,219,584