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 00:28Victor MerckléVictor MerckléScore: 2,588Success
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 00:302,52114,138,9504,975,0001,329,0002,113,536
2May 30, 2026 00:302,52515,331,1624,989,0001,325,0002,113,536
3May 30, 2026 00:302,55014,168,8305,046,0001,331,0002,113,536
4May 30, 2026 00:302,55515,986,1255,042,0001,346,0002,113,536
5May 30, 2026 00:302,58816,052,6455,109,0001,362,0002,113,536
6May 30, 2026 00:302,62115,072,2425,229,0001,325,0002,113,536
7May 30, 2026 00:302,62714,254,0895,245,0001,324,0002,113,536
8May 30, 2026 00:302,62814,326,6505,245,0001,325,0002,113,536
9May 30, 2026 00:302,64415,987,2555,269,0001,343,0002,113,536