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 5, 2026 22:10Victor MerckléVictor MerckléScore: 1,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:121,63111,975,8942,914,0001,164,0002,117,632stderr
2Jul 5, 2026 22:121,63312,037,4322,925,0001,159,0002,117,632stderr
3Jul 5, 2026 22:121,64212,090,1112,939,0001,168,0002,117,632stderr
4Jul 5, 2026 22:121,65212,144,7702,944,0001,186,0002,117,632stderr
5Jul 5, 2026 22:121,65812,889,9042,946,0001,199,0002,117,632stderr
6Jul 5, 2026 22:121,69612,188,0063,047,0001,195,0002,117,632stderr
7Jul 5, 2026 22:121,70812,704,2733,070,0001,202,0002,117,632stderr
8Jul 5, 2026 22:121,71312,316,7473,064,0001,220,0002,117,632stderr
9Jul 5, 2026 22:121,74612,365,8003,144,0001,222,0002,117,632stderr