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 00:10Elijah KinElijah KinScore: 2,306Success
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 00:112,28214,674,4824,593,0001,114,0002,117,632
2Jun 7, 2026 00:112,29414,726,1974,617,0001,119,0002,117,632
3Jun 7, 2026 00:112,29614,767,8524,637,0001,103,0002,117,632
4Jun 7, 2026 00:112,30014,754,9124,649,0001,101,0002,117,632
5Jun 7, 2026 00:112,30614,846,6474,657,0001,110,0002,117,632
6Jun 7, 2026 00:112,36215,063,3284,806,0001,101,0002,117,632
7Jun 7, 2026 00:112,45315,170,7195,038,0001,096,0002,117,632
8Jun 7, 2026 00:112,47415,174,0165,082,0001,105,0002,117,632
9Jun 7, 2026 00:112,48115,292,4605,107,0001,097,0002,117,632