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 5, 2026 21:51Elijah KinElijah KinScore: 2,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 21:532,37615,024,6784,636,0001,306,0002,117,632
2Jun 5, 2026 21:532,38314,939,4104,846,0001,113,0002,117,632
3Jun 5, 2026 21:532,39415,062,5764,881,0001,106,0002,117,632
4Jun 5, 2026 21:532,41015,036,2164,905,0001,121,0002,117,632
5Jun 5, 2026 21:532,57715,479,3575,348,0001,096,0002,117,632
6Jun 5, 2026 21:532,60715,528,3595,422,0001,096,0002,117,632
7Jun 5, 2026 21:532,61215,637,6015,435,0001,097,0002,117,632
8Jun 5, 2026 21:532,65415,694,5795,527,0001,109,0002,117,632
9Jun 5, 2026 21:532,67815,729,1045,584,0001,113,0002,117,632