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 20, 2026 15:02Victor MerckléVictor MerckléScore: 2,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:082,74514,644,1485,498,0001,365,0002,113,536
2May 20, 2026 15:082,74717,689,9355,503,0001,365,0002,113,536
3May 20, 2026 15:082,75215,352,3175,511,0001,369,0002,113,536
4May 20, 2026 15:082,75915,272,5555,528,0001,370,0002,113,536
5May 20, 2026 15:082,76015,488,7265,526,0001,374,0002,113,536
6May 20, 2026 15:082,84816,839,0875,755,0001,365,0002,113,536
7May 20, 2026 15:082,86016,832,4215,792,0001,358,0002,113,536
8May 20, 2026 15:082,88417,211,5485,847,0001,363,0002,113,536
9May 20, 2026 15:082,93915,260,2044,988,0002,361,0002,113,536