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 21:33Elijah KinElijah KinScore: 2,231Success
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 21:342,15415,272,6484,121,0001,266,0002,117,632
2Aug 27, 2026 21:342,20515,303,8334,253,0001,260,0002,117,632
3Aug 27, 2026 21:342,20815,344,9484,273,0001,248,0002,117,632
4Aug 27, 2026 21:342,23015,344,6174,302,0001,273,0002,117,632
5Aug 27, 2026 21:342,23115,322,7354,315,0001,264,0002,117,632
6Aug 27, 2026 21:342,24315,596,2034,361,0001,247,0002,117,632
7Aug 27, 2026 21:342,24415,764,0254,353,0001,257,0002,117,632
8Aug 27, 2026 21:342,25115,401,4064,376,0001,253,0002,117,632
9Aug 27, 2026 21:342,32115,607,1684,695,0001,109,0002,117,632