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 listJun 1, 2026 10:26Victor MerckléVictor MerckléScore: 2,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 10:272,50213,800,9394,934,0001,323,0002,113,536
2Jun 1, 2026 10:272,54713,973,2725,036,0001,332,0002,113,536
3Jun 1, 2026 10:272,58714,050,3925,148,0001,320,0002,113,536
4Jun 1, 2026 10:272,60514,031,6325,193,0001,320,0002,113,536
5Jun 1, 2026 10:272,60613,982,6345,195,0001,322,0002,113,536
6Jun 1, 2026 10:272,60714,279,6685,198,0001,321,0002,113,536
7Jun 1, 2026 10:272,60814,049,6325,199,0001,322,0002,113,536
8Jun 1, 2026 10:272,60914,043,6515,200,0001,323,0002,113,536
9Jun 1, 2026 10:272,64414,135,6795,270,0001,340,0002,113,536