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 8, 2026 15:11Elijah KinElijah KinScore: 2,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 15:122,21014,525,7344,316,0001,211,0002,117,632
2Jun 8, 2026 15:122,21514,612,7464,312,0001,227,0002,117,632
3Jun 8, 2026 15:122,26614,800,2884,509,0001,158,0002,117,632
4Jun 8, 2026 15:122,27614,816,1834,518,0001,174,0002,117,632
5Jun 8, 2026 15:122,28414,801,5194,446,0001,266,0002,117,632
6Jun 8, 2026 15:122,30614,805,4334,484,0001,283,0002,117,632
7Jun 8, 2026 15:122,34214,959,4654,579,0001,278,0002,117,632
8Jun 8, 2026 15:122,40915,147,9434,731,0001,293,0002,117,632
9Jun 8, 2026 15:122,43215,106,4814,941,0001,139,0002,117,632