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 12:51Victor 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
1May 30, 2026 12:532,53314,597,7934,997,0001,337,0002,113,536
2May 30, 2026 12:532,53914,209,9035,012,0001,336,0002,113,536
3May 30, 2026 12:532,54115,969,1925,014,0001,340,0002,113,536
4May 30, 2026 12:532,58216,368,9265,122,0001,334,0002,113,536
5May 30, 2026 12:532,60616,685,9654,246,0002,270,0002,113,536
6May 30, 2026 12:532,62114,398,3105,220,0001,334,0002,113,536
7May 30, 2026 12:532,62614,236,4615,231,0001,335,0002,113,536
8May 30, 2026 12:532,64916,438,5855,263,0001,361,0002,113,536
9May 30, 2026 12:532,69415,448,5584,458,0002,277,0002,113,536