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 1, 2026 10:11Victor MerckléVictor MerckléScore: 2,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 10:122,49413,775,9904,915,0001,321,0002,113,536
2Jun 1, 2026 10:122,51413,917,3054,957,0001,330,0002,113,536
3Jun 1, 2026 10:122,52613,884,7444,988,0001,328,0002,113,536
4Jun 1, 2026 10:122,53715,274,0834,998,0001,345,0002,113,536
5Jun 1, 2026 10:122,56013,959,6405,058,0001,342,0002,113,536
6Jun 1, 2026 10:122,57113,979,6725,070,0001,359,0002,113,536
7Jun 1, 2026 10:122,60414,036,9815,193,0001,319,0002,113,536
8Jun 1, 2026 10:122,61314,119,8945,212,0001,322,0002,113,536
9Jun 1, 2026 10:122,63614,103,5385,256,0001,335,0002,113,536