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 2, 2026 17:31Victor MerckléVictor MerckléScore: 1,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 17:321,87712,389,1593,568,0001,125,0002,113,536
2Jun 2, 2026 17:321,88412,406,7393,583,0001,128,0002,113,536
3Jun 2, 2026 17:321,89212,375,9823,601,0001,131,0002,113,536
4Jun 2, 2026 17:321,89912,372,0133,570,0001,179,0002,113,536
5Jun 2, 2026 17:321,89912,401,0683,615,0001,133,0002,113,536
6Jun 2, 2026 17:321,90612,425,9833,580,0001,187,0002,113,536
7Jun 2, 2026 17:321,91012,417,1543,590,0001,187,0002,113,536
8Jun 2, 2026 17:321,92712,439,7133,619,0001,199,0002,113,536
9Jun 2, 2026 17:321,96312,493,4283,706,0001,203,0002,113,536