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 17:59Elijah KinElijah KinScore: 2,374Success
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 18:002,18915,316,3674,182,0001,292,0002,117,632
2Aug 27, 2026 18:002,28615,463,7454,430,0001,287,0002,117,632
3Aug 27, 2026 18:002,33615,591,6294,558,0001,284,0002,117,632
4Aug 27, 2026 18:002,36215,592,2324,633,0001,272,0002,117,632
5Aug 27, 2026 18:002,37415,768,0814,652,0001,284,0002,117,632
6Aug 27, 2026 18:002,37616,499,1944,656,0001,284,0002,117,632
7Aug 27, 2026 18:002,40815,906,5574,744,0001,278,0002,117,632
8Aug 27, 2026 18:002,42716,098,1924,784,0001,284,0002,117,632
9Aug 27, 2026 18:002,43717,128,8944,761,0001,332,0002,117,632