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 3, 2026 03:22Victor MerckléVictor MerckléScore: 1,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 03:231,73512,021,1753,116,0001,223,0002,113,536
2Jun 3, 2026 03:231,75512,015,3043,139,0001,250,0002,113,536
3Jun 3, 2026 03:231,79112,099,4183,199,0001,279,0002,113,536
4Jun 3, 2026 03:231,79313,515,3683,263,0001,221,0002,113,536
5Jun 3, 2026 03:231,79912,113,3393,202,0001,296,0002,113,536
6Jun 3, 2026 03:231,80112,169,2993,281,0001,223,0002,113,536
7Jun 3, 2026 03:231,82112,240,7623,188,0001,366,0002,113,536
8Jun 3, 2026 03:231,85712,693,0543,422,0001,221,0002,113,536
9Jun 3, 2026 03:231,91212,835,7513,542,0001,240,0002,113,536