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 27, 2026 18:20Elijah KinElijah KinScore: 2,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 18:211,98614,276,5123,715,0001,250,0002,117,632
2Jun 27, 2026 18:211,98614,239,6373,720,0001,246,0002,117,632
3Jun 27, 2026 18:212,00025,649,5733,766,0001,234,0002,113,536
4Jun 27, 2026 18:212,03314,401,0983,846,0001,238,0002,117,632
5Jun 27, 2026 18:212,08014,481,6543,942,0001,259,0002,117,632
6Jun 27, 2026 18:212,10814,591,4314,008,0001,263,0002,117,632
7Jun 27, 2026 18:212,15814,811,6014,157,0001,238,0002,117,632
8Jun 27, 2026 18:212,23414,868,3924,271,0001,314,0002,117,632
9Jun 27, 2026 18:212,24616,543,0704,263,0001,352,0002,117,632