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 21, 2026 16:28Dominique GarmierDominique GarmierScore: 4,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 06:424,655725,417,041682,221,00015,981,00017,080,320
2Mar 21, 2026 16:284,656726,626,204677,398,00020,950,00016,957,440
3Mar 21, 2026 16:284,658725,721,350681,661,00016,966,00017,190,912
4Mar 21, 2026 16:284,659726,497,120682,940,00015,975,00017,149,952
5Mar 24, 2026 06:424,663724,415,341685,522,00013,969,00017,133,568
6Mar 21, 2026 16:284,668730,836,504681,196,00018,977,00016,969,728
7Mar 21, 2026 16:284,671730,400,443686,606,00013,971,00017,190,912
8Mar 21, 2026 16:284,674726,203,730684,169,00016,979,00016,965,632
9Mar 24, 2026 06:424,676727,794,744682,356,00018,982,00017,125,376