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:11Elijah KinElijah KinScore: 2,272Success
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 17:122,00614,902,5813,788,0001,229,0002,117,632
2Aug 27, 2026 17:122,20015,203,0034,234,0001,267,0002,117,632
3Aug 27, 2026 17:122,24015,338,0514,334,0001,266,0002,117,632
4Aug 27, 2026 17:122,27215,537,7594,427,0001,254,0002,117,632
5Aug 27, 2026 17:122,27215,511,0504,424,0001,257,0002,117,632
6Aug 27, 2026 17:122,28915,480,3034,473,0001,250,0002,117,632
7Aug 27, 2026 17:122,29116,259,5204,467,0001,262,0002,117,632
8Aug 27, 2026 17:122,30115,508,0514,658,0001,096,0002,117,632
9Aug 27, 2026 17:122,30716,324,0584,522,0001,247,0002,117,632