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 00:37Elijah KinElijah KinScore: 2,587Success
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 00:382,55915,423,8225,295,0001,104,0002,117,632
2Jun 5, 2026 00:382,56215,398,8405,304,0001,101,0002,117,632
3Jun 5, 2026 00:382,57115,364,6855,321,0001,108,0002,117,632
4Jun 5, 2026 00:382,57615,504,5505,335,0001,106,0002,117,632
5Jun 5, 2026 00:382,58717,291,9855,367,0001,101,0002,117,632
6Jun 5, 2026 00:382,58815,550,1615,366,0001,104,0002,117,632
7Jun 5, 2026 00:382,58915,504,5175,364,0001,109,0002,117,632
8Jun 5, 2026 00:382,59115,632,0465,365,0001,113,0002,117,632
9Jun 5, 2026 00:382,65115,692,8825,500,0001,128,0002,117,632