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 14:05anboto1anboto1Score: 3,113Success
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 14:053,103475,502,355440,037,00025,517,00016,793,600
2Jun 24, 2026 14:053,105475,080,469440,264,00025,561,00016,793,600
3Jun 24, 2026 14:053,107475,286,780440,800,00025,295,00016,793,600
4Jun 24, 2026 14:053,112475,966,338441,291,00025,593,00016,793,600
5Jun 24, 2026 14:053,113476,180,668441,496,00025,537,00016,793,600
6Jun 24, 2026 14:053,114476,257,944442,076,00025,048,00016,793,600
7Jun 24, 2026 14:053,121477,305,194442,506,00025,768,00016,793,600
8Jun 24, 2026 14:053,123477,685,897443,522,00025,043,00016,793,600
9Jun 24, 2026 14:053,124477,839,373442,858,00025,871,00016,793,600