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 10, 2026 20:56Victor MerckléVictor MerckléScore: 25,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 21:0225,31270,787,65662,271,0001,011,0002,113,536
2Jun 10, 2026 21:0225,32571,877,15462,302,0001,012,0002,113,536
3Jun 10, 2026 21:0225,32770,782,84262,307,0001,012,0002,113,536
4Jun 10, 2026 21:0225,34170,777,53062,342,0001,012,0002,113,536
5Jun 10, 2026 21:0225,35572,029,71962,376,0001,012,0002,113,536
6Jun 10, 2026 21:0225,36070,762,52262,386,0001,014,0002,113,536
7Jun 10, 2026 21:0225,36272,059,19562,393,0001,013,0002,113,536
8Jun 10, 2026 21:0225,37970,818,31362,435,0001,014,0002,113,536
9Jun 10, 2026 21:0225,38970,821,12062,457,0001,016,0002,113,536