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 30, 2026 21:34Victor MerckléVictor MerckléScore: 1,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:361,69112,128,1493,064,0001,165,0002,117,632stderr
2Jun 30, 2026 21:361,69712,205,5613,077,0001,167,0002,117,632stderr
3Jun 30, 2026 21:361,69912,024,7473,081,0001,168,0002,117,632stderr
4Jun 30, 2026 21:361,71412,212,1863,103,0001,182,0002,117,632stderr
5Jun 30, 2026 21:361,75012,292,0593,197,0001,180,0002,117,632stderr
6Jun 30, 2026 21:361,77512,432,0793,126,0001,313,0002,117,632stderr
7Jun 30, 2026 21:361,79512,418,6693,300,0001,188,0002,117,632stderr
8Jun 30, 2026 21:361,87712,623,6923,520,0001,173,0002,117,632stderr
9Jun 30, 2026 21:361,89212,973,2633,510,0001,221,0002,117,632stderr