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 07:49Victor MerckléVictor MerckléScore: 2,554Success
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 07:512,52514,051,2964,982,0001,332,0002,113,536
2May 30, 2026 07:512,53214,116,0744,995,0001,337,0002,113,536
3May 30, 2026 07:512,54014,148,1125,014,0001,336,0002,113,536
4May 30, 2026 07:512,55215,367,2015,041,0001,340,0002,113,536
5May 30, 2026 07:512,55414,140,4335,035,0001,352,0002,113,536
6May 30, 2026 07:512,57414,886,4935,097,0001,339,0002,113,536
7May 30, 2026 07:512,64414,570,8225,273,0001,337,0002,113,536
8May 30, 2026 07:512,64514,393,4854,329,0002,285,0002,113,536
9May 30, 2026 07:512,69714,370,1744,445,0002,298,0002,113,536