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 listApr 13, 2026 08:45limanjun99limanjun99Score: 3,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:453,08829,698,8905,515,0002,206,0002,359,296
2Apr 13, 2026 08:453,08923,664,9616,619,0001,103,0002,285,568
3Apr 13, 2026 08:453,09027,319,2416,623,0001,103,0002,293,760
4Apr 13, 2026 08:453,09122,506,2765,520,0002,208,0002,293,760
5Apr 13, 2026 08:453,10625,102,6685,547,0002,219,0002,293,760
6Apr 13, 2026 08:453,10823,163,5655,550,0002,220,0002,285,568
7Apr 13, 2026 08:453,15124,733,9796,894,000984,0002,514,944
8Apr 13, 2026 08:453,16024,960,9265,926,0001,975,0002,523,136
9Apr 13, 2026 08:453,19925,308,8294,998,0002,999,0002,293,760