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 listAug 15, 2026 17:28Tomislav TunkovicTomislav TunkovicScore: 1,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:291,53212,109,2503,831,0000524,288
2Aug 15, 2026 17:291,53412,143,7793,837,0000524,288
3Aug 15, 2026 17:291,53612,220,3843,840,0000524,288
4Aug 15, 2026 17:291,54112,171,0633,854,0000524,288
5Aug 15, 2026 17:291,58812,291,8463,970,0000524,288
6Aug 15, 2026 17:291,63812,384,2304,096,0000524,288
7Aug 15, 2026 17:291,64412,414,6334,111,0000524,288
8Aug 15, 2026 17:291,65512,379,0624,138,0000524,288
9Aug 15, 2026 17:291,66412,857,4224,161,0000524,288