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 30, 2026 17:07Charles CabergsCharles CabergsScore: 5,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 17:085,14229,778,8388,571,0004,285,0002,412,544
2Apr 30, 2026 17:085,18331,666,2228,972,0003,987,0002,412,544
3Apr 30, 2026 17:085,18431,437,7049,971,0002,991,0002,412,544
4Apr 30, 2026 17:085,23028,387,05310,058,0003,017,0002,482,176
5Apr 30, 2026 17:085,24030,529,0269,071,0004,031,0002,412,544
6Apr 30, 2026 17:085,25027,806,8118,078,0005,048,0002,420,736
7Apr 30, 2026 17:085,29932,540,1059,173,0004,076,0002,412,544
8Apr 30, 2026 17:085,40635,260,37710,397,0003,119,0002,416,640
9Apr 30, 2026 17:085,43835,968,43412,550,0001,045,0002,416,640