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 listAug 27, 2026 16:51Elijah KinElijah KinScore: 2,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:522,19415,289,6284,235,0001,252,0002,117,632
2Aug 27, 2026 16:522,22615,582,0394,299,0001,267,0002,117,632
3Aug 27, 2026 16:522,24515,377,7584,363,0001,251,0002,117,632
4Aug 27, 2026 16:522,25915,416,6584,392,0001,256,0002,117,632
5Aug 27, 2026 16:522,29015,590,8774,452,0001,273,0002,117,632
6Aug 27, 2026 16:522,29615,510,7754,500,0001,242,0002,117,632
7Aug 27, 2026 16:522,30015,626,3864,496,0001,255,0002,117,632
8Aug 27, 2026 16:522,32315,623,2484,568,0001,240,0002,117,632
9Aug 27, 2026 16:522,32915,684,5554,562,0001,262,0002,117,632