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:07TudyMTudyMScore: 8,322Success
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:108,2181,254,718,5121,198,795,00033,965,00017,022,976
2Apr 26, 2026 20:108,2191,255,536,0901,197,009,00035,970,00017,002,496
3Apr 26, 2026 20:108,2631,253,898,5751,204,504,00034,985,00017,014,784
4Apr 26, 2026 20:108,3031,267,833,5381,214,519,00030,987,00017,010,688
5Apr 26, 2026 20:108,3221,272,955,6331,216,363,00031,983,00017,018,880
6Apr 26, 2026 20:108,3351,267,327,9001,215,312,00034,980,00017,014,784
7Apr 26, 2026 20:108,3461,275,263,8101,220,981,00030,974,00017,018,880
8Apr 26, 2026 20:108,3531,269,367,3431,219,988,00032,972,00017,018,880
9Apr 26, 2026 20:108,4301,279,324,2441,233,652,00030,966,00017,240,064