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 24, 2025 22:14KeefeKeefeScore: 6,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 22:146,095943,617,181897,249,00016,985,00016,986,112
2Apr 24, 2025 22:146,105942,212,359900,710,00014,995,00016,998,400
3Apr 24, 2025 22:146,113941,599,954899,878,00016,997,00016,953,344
4Apr 24, 2025 22:146,116944,051,437902,386,00014,989,00017,182,720
5Apr 24, 2025 22:146,116949,621,026903,460,00013,991,00016,990,208
6Apr 24, 2025 22:146,120946,193,665905,046,00013,000,00017,002,496
7Apr 24, 2025 22:146,121950,448,198899,211,00018,983,00016,977,920
8Apr 24, 2025 22:146,5261,010,324,736962,957,00015,999,00016,994,304
9Apr 24, 2025 22:146,5621,008,089,631968,334,00015,989,00016,953,344