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 listJul 14, 2026 07:40Victor MerckléVictor MerckléScore: 1,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 07:421,59712,106,3952,900,0001,093,0002,117,632stderr
2Jul 14, 2026 07:421,64512,298,3062,987,0001,126,0002,117,632stderr
3Jul 14, 2026 07:421,65912,417,9872,999,0001,149,0002,117,632stderr
4Jul 14, 2026 07:421,69212,311,7713,115,0001,115,0002,117,632stderr
5Jul 14, 2026 07:421,70612,917,1583,135,0001,130,0002,117,632stderr
6Jul 14, 2026 07:421,70612,398,1893,117,0001,150,0002,117,632stderr
7Jul 14, 2026 07:421,71212,949,3883,134,0001,146,0002,117,632stderr
8Jul 14, 2026 07:421,71413,784,0243,029,0001,257,0002,117,632stderr
9Jul 14, 2026 07:421,71612,389,6693,147,0001,144,0002,117,632stderr