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 7, 2026 18:09Victor MerckléVictor MerckléScore: 2,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:102,45216,501,5363,683,0002,448,0002,146,304stderr
2Jul 7, 2026 18:102,46616,674,3163,513,0002,653,0002,146,304stderr
3Jul 7, 2026 18:102,46716,388,1123,972,0002,196,0002,146,304stderr
4Jul 7, 2026 18:102,50916,630,8903,749,0002,525,0002,146,304stderr
5Jul 7, 2026 18:102,52915,413,1323,816,0002,507,0002,146,304stderr
6Jul 7, 2026 18:102,53916,866,5803,793,0002,556,0002,146,304stderr
7Jul 7, 2026 18:102,55917,052,2453,798,0002,600,0002,146,304stderr
8Jul 7, 2026 18:102,56116,789,7943,858,0002,546,0002,146,304stderr
9Jul 7, 2026 18:102,56716,990,7183,809,0002,610,0002,146,304stderr