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 20:12TudyMTudyMScore: 9,195Success
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 20:129,0941,379,739,5771,332,145,00031,979,00017,149,952
2Apr 26, 2026 20:129,1011,383,937,0561,334,241,00030,982,00017,014,784
3Apr 26, 2026 20:129,1131,388,588,4301,333,093,00033,976,00017,018,880
4Apr 26, 2026 20:129,1811,397,901,1151,348,284,00028,984,00017,022,976
5Apr 26, 2026 20:129,1951,399,574,8391,349,271,00030,006,00016,998,400
6Apr 26, 2026 20:129,2001,400,090,6971,342,031,00037,972,00017,018,880
7Apr 26, 2026 20:129,2641,411,662,5841,355,750,00033,968,00017,018,880
8Apr 26, 2026 20:129,3011,413,702,2221,363,222,00031,981,00017,018,880
9Apr 26, 2026 20:129,3921,431,456,9231,376,914,00031,974,00017,154,048