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 22:28Elijah KinElijah KinScore: 2,226Success
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 22:292,05514,844,8493,878,0001,260,0002,117,632
2Aug 27, 2026 22:292,06414,906,1974,055,0001,107,0002,117,632
3Aug 27, 2026 22:292,17515,198,4714,178,0001,260,0002,117,632
4Aug 27, 2026 22:292,20915,410,3674,262,0001,262,0002,117,632
5Aug 27, 2026 22:292,22615,293,9044,316,0001,250,0002,117,632
6Aug 27, 2026 22:292,23215,319,2744,325,0001,256,0002,117,632
7Aug 27, 2026 22:292,33615,600,6384,573,0001,267,0002,117,632
8Aug 27, 2026 22:292,33615,634,3304,747,0001,095,0002,117,632
9Aug 27, 2026 22:292,34115,576,6624,585,0001,269,0002,117,632