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 listMar 25, 2026 17:07Dominique GarmierDominique GarmierScore: 6,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 14:006,6201,013,697,701980,970,00011,987,00017,072,128
2Mar 25, 2026 17:076,6221,015,619,402982,318,00010,992,00016,998,400
3Mar 25, 2026 17:116,6261,015,979,187980,841,00012,984,00017,162,240
4Mar 25, 2026 17:116,6261,020,499,267981,911,00011,986,00017,068,032
5Mar 25, 2026 14:006,6271,019,833,510982,055,00011,988,00017,100,800
6Mar 25, 2026 17:116,6371,018,280,625983,548,00011,982,00017,072,128
7Mar 25, 2026 14:006,6471,028,573,863985,118,00011,977,00016,969,728
8Mar 25, 2026 17:076,6501,018,941,166985,555,00011,982,00017,014,784
9Mar 25, 2026 17:076,8891,057,726,9131,020,357,00012,979,00016,982,016