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 listJun 7, 2026 16:11Elijah KinElijah KinScore: 2,432Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:122,15514,483,5654,132,0001,257,0002,117,632
2Jun 7, 2026 16:122,21414,607,5574,415,0001,122,0002,117,632
3Jun 7, 2026 16:122,34414,948,5084,582,0001,279,0002,117,632
4Jun 7, 2026 16:122,42315,151,6274,763,0001,296,0002,117,632
5Jun 7, 2026 16:122,43215,092,5514,794,0001,287,0002,117,632
6Jun 7, 2026 16:122,43315,595,4214,800,0001,283,0002,117,632
7Jun 7, 2026 16:122,43515,175,3514,798,0001,291,0002,117,632
8Jun 7, 2026 16:122,43715,108,3564,806,0001,288,0002,117,632
9Jun 7, 2026 16:122,44415,152,1244,832,0001,278,0002,117,632