Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 20, 2026 16:43M-RochatM-RochatScore: 4,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:434,69421,080,37610,660,0001,075,0002,113,536
2May 20, 2026 16:434,70621,294,84510,689,0001,076,0002,113,536
3May 20, 2026 16:434,71221,134,21410,704,0001,076,0002,113,536
4May 20, 2026 16:434,71221,335,68910,705,0001,077,0002,113,536
5May 20, 2026 16:434,71821,196,29110,718,0001,077,0002,117,632
6May 20, 2026 16:434,72921,098,35510,748,0001,076,0002,121,728
7May 20, 2026 16:434,96622,252,98911,325,0001,090,0002,113,536
8May 20, 2026 16:434,98622,331,24511,380,0001,086,0002,113,536
9May 20, 2026 16:434,99522,343,74011,402,0001,086,0002,113,536