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 3, 2026 10:02Victor MerckléVictor MerckléScore: 1,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 10:041,70811,970,5003,077,0001,194,0002,113,536
2Jun 3, 2026 10:041,71411,926,5193,082,0001,205,0002,113,536
3Jun 3, 2026 10:041,71711,949,7923,092,0001,202,0002,113,536
4Jun 3, 2026 10:041,71912,047,9973,091,0001,208,0002,113,536
5Jun 3, 2026 10:041,72211,938,0523,097,0001,210,0002,113,536
6Jun 3, 2026 10:041,72611,997,1233,104,0001,211,0002,113,536
7Jun 3, 2026 10:041,72911,994,3723,112,0001,211,0002,113,536
8Jun 3, 2026 10:041,73111,971,8053,117,0001,211,0002,113,536
9Jun 3, 2026 10:041,83612,375,3363,395,0001,197,0002,113,536