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 29, 2026 23:52Victor MerckléVictor MerckléScore: 2,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:532,52514,890,7734,980,0001,334,0002,113,536
2May 29, 2026 23:532,53014,959,7434,994,0001,332,0002,113,536
3May 29, 2026 23:532,53214,442,9034,997,0001,334,0002,113,536
4May 29, 2026 23:532,53416,221,5385,000,0001,335,0002,113,536
5May 29, 2026 23:532,56014,453,8605,064,0001,337,0002,113,536
6May 29, 2026 23:532,62415,055,4275,230,0001,330,0002,113,536
7May 29, 2026 23:532,65517,090,8545,289,0001,349,0002,113,536
8May 29, 2026 23:532,65814,754,0445,298,0001,349,0002,113,536
9May 29, 2026 23:532,67316,450,5545,353,0001,330,0002,113,536