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 listJun 1, 2026 12:13Victor MerckléVictor MerckléScore: 2,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 12:152,52913,807,9604,992,0001,332,0002,113,536
2Jun 1, 2026 12:152,53413,840,6274,994,0001,341,0002,113,536
3Jun 1, 2026 12:152,61014,095,1865,204,0001,323,0002,113,536
4Jun 1, 2026 12:152,61114,201,9835,203,0001,325,0002,113,536
5Jun 1, 2026 12:152,62114,060,7265,228,0001,325,0002,113,536
6Jun 1, 2026 12:152,62313,993,7725,231,0001,328,0002,113,536
7Jun 1, 2026 12:152,62514,054,8925,239,0001,325,0002,113,536
8Jun 1, 2026 12:152,62614,089,4575,240,0001,327,0002,113,536
9Jun 1, 2026 12:152,69014,616,9924,461,0002,266,0002,113,536