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 listApr 26, 2026 17:26TudyMTudyMScore: 1,578,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:271,578,0793,970,860,2203,945,198,00002,310,144
2Apr 26, 2026 17:271,578,2013,969,277,9933,942,506,0002,998,0002,318,336
3Apr 26, 2026 17:271,578,3303,967,705,9263,943,829,0001,998,0002,445,312