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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 11:581,71911,936,3913,094,0001,205,0002,113,536
2Jun 7, 2026 11:581,72612,012,6953,109,0001,208,0002,113,536
3Jun 7, 2026 11:581,74911,990,1743,153,0001,220,0002,113,536
4Jun 7, 2026 11:581,74912,095,9363,158,0001,216,0002,113,536
5Jun 7, 2026 11:581,75012,039,1913,168,0001,209,0002,113,536
6Jun 7, 2026 11:581,81712,285,5193,339,0001,205,0002,113,536
7Jun 7, 2026 11:581,81814,344,0723,336,0001,211,0002,113,536
8Jun 7, 2026 11:581,86112,295,2133,443,0001,210,0002,113,536
9Jun 7, 2026 11:581,87412,359,0313,340,0001,346,0002,113,536