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 28, 2026 09:04TudyMTudyMScore: 5,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:055,431832,758,232786,731,00027,990,00017,145,856
2Apr 28, 2026 09:055,436840,731,920786,549,00028,983,00017,145,856
3Apr 28, 2026 09:055,461837,182,283789,236,00029,971,00017,018,880
4Apr 28, 2026 09:055,463837,723,185787,508,00031,980,00017,002,496
5Apr 28, 2026 09:055,469838,297,461796,481,00023,984,00017,145,856
6Apr 28, 2026 09:055,475837,700,232793,360,00027,977,00017,145,856
7Apr 28, 2026 09:055,476842,503,709795,471,00025,982,00017,145,856
8Apr 28, 2026 09:055,477839,552,026785,659,00035,984,00017,211,392
9Apr 28, 2026 09:055,478841,475,403789,736,00031,989,00017,002,496