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 listJun 24, 2026 13:52anboto1anboto1Score: 3,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 13:533,087472,356,907438,688,00024,477,00016,793,600
2Jun 24, 2026 13:533,091472,957,738438,265,00025,516,00016,793,600
3Jun 24, 2026 13:533,094473,376,401438,361,00025,804,00016,793,600
4Jun 24, 2026 13:533,105474,864,636439,860,00025,906,00016,793,600
5Jun 24, 2026 13:533,109475,562,111440,680,00025,783,00016,793,600
6Jun 24, 2026 13:533,113476,055,112442,034,00024,930,00016,793,600
7Jun 24, 2026 13:533,117477,076,432441,874,00025,798,00016,793,600
8Jun 24, 2026 13:533,118476,945,856442,269,00025,546,00016,793,600
9Jun 24, 2026 13:533,176494,334,791450,043,00026,377,00016,793,600