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 2, 2026 00:27Victor MerckléVictor MerckléScore: 2,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 00:292,24413,302,5584,380,0001,231,0002,113,536
2Jun 2, 2026 00:292,25313,345,9294,398,0001,236,0002,113,536
3Jun 2, 2026 00:292,25413,380,4924,401,0001,235,0002,113,536
4Jun 2, 2026 00:292,35213,651,7764,652,0001,228,0002,113,536
5Jun 2, 2026 00:292,36013,803,5144,673,0001,229,0002,113,536
6Jun 2, 2026 00:292,36613,828,6544,680,0001,236,0002,113,536
7Jun 2, 2026 00:292,37013,614,7424,691,0001,235,0002,113,536
8Jun 2, 2026 00:292,37013,534,4514,689,0001,236,0002,113,536
9Jun 2, 2026 00:292,37113,494,0164,696,0001,233,0002,113,536