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 20:59Elijah KinElijah KinScore: 2,326Success
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:002,19115,284,5854,223,0001,255,0002,117,632
2Aug 27, 2026 21:002,26515,392,6194,392,0001,272,0002,117,632
3Aug 27, 2026 21:002,28615,416,6604,446,0001,269,0002,117,632
4Aug 27, 2026 21:002,30215,648,9104,514,0001,243,0002,117,632
5Aug 27, 2026 21:002,32615,584,3684,551,0001,266,0002,117,632
6Aug 27, 2026 21:002,33415,621,4334,580,0001,257,0002,117,632
7Aug 27, 2026 21:002,35215,830,3764,616,0001,264,0002,117,632
8Aug 27, 2026 21:002,37615,853,7814,684,0001,257,0002,117,632
9Aug 27, 2026 21:002,38816,512,8134,877,0001,093,0002,117,632