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 listMay 30, 2026 03:41Elijah KinElijah KinScore: 9,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:439,1241,381,003,8521,341,250,00027,355,00016,793,600
2May 30, 2026 03:439,1261,379,117,0021,344,252,00024,702,00016,793,600
3May 30, 2026 03:439,1361,381,696,6481,344,863,00025,561,00016,793,600
4May 30, 2026 03:439,1401,381,000,9921,345,724,00025,366,00016,793,600
5May 30, 2026 03:439,1441,382,117,6631,346,080,00025,603,00016,793,600
6May 30, 2026 03:439,1461,382,850,3011,346,297,00025,701,00016,793,600
7May 30, 2026 03:439,1491,385,039,9621,347,120,00025,371,00016,793,600
8May 30, 2026 03:439,1791,387,929,5481,351,334,00025,537,00016,793,600
9May 30, 2026 03:439,2141,397,306,7491,356,616,00025,527,00016,793,600