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 listMay 30, 2026 05:55Victor MerckléVictor MerckléScore: 2,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 05:572,53615,406,9594,990,0001,351,0002,113,536
2May 30, 2026 05:572,60114,774,8155,111,0001,392,0002,113,536
3May 30, 2026 05:572,62114,239,0865,202,0001,351,0002,113,536
4May 30, 2026 05:572,62214,851,7485,207,0001,348,0002,113,536
5May 30, 2026 05:572,62614,562,0255,210,0001,355,0002,113,536
6May 30, 2026 05:572,62815,855,3075,217,0001,353,0002,113,536
7May 30, 2026 05:572,63515,674,3975,240,0001,349,0002,113,536
8May 30, 2026 05:572,68915,147,4474,407,0002,317,0002,113,536
9May 30, 2026 05:572,69115,266,6814,424,0002,305,0002,113,536