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 03:41Victor MerckléVictor MerckléScore: 2,539Success
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 03:422,52216,613,1194,973,0001,333,0002,113,536
2May 30, 2026 03:422,52315,508,9474,978,0001,330,0002,113,536
3May 30, 2026 03:422,53214,380,6484,997,0001,335,0002,113,536
4May 30, 2026 03:422,53614,317,1495,005,0001,337,0002,113,536
5May 30, 2026 03:422,53914,129,6895,007,0001,342,0002,113,536
6May 30, 2026 03:422,58014,311,7585,121,0001,330,0002,113,536
7May 30, 2026 03:422,58815,993,2685,102,0001,370,0002,113,536
8May 30, 2026 03:422,61814,340,9815,220,0001,327,0002,113,536
9May 30, 2026 03:422,67215,698,5974,413,0002,268,0002,113,536