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 8, 2026 11:35Victor MerckléVictor MerckléScore: 1,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 11:371,69613,301,3173,052,0001,189,0002,113,536
2Jun 8, 2026 11:371,73811,971,2983,131,0001,216,0002,113,536
3Jun 8, 2026 11:371,74112,052,2343,134,0001,219,0002,113,536
4Jun 8, 2026 11:371,75412,039,1563,162,0001,223,0002,113,536
5Jun 8, 2026 11:371,75612,052,5153,159,0001,232,0002,113,536
6Jun 8, 2026 11:371,75912,295,8563,174,0001,225,0002,113,536
7Jun 8, 2026 11:371,88512,428,9593,496,0001,218,0002,113,536
8Jun 8, 2026 11:371,88812,377,9443,505,0001,215,0002,113,536
9Jun 8, 2026 11:371,89512,844,7803,492,0001,246,0002,113,536