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 listNov 6, 2026 14:24Andrew EpsteinAndrew EpsteinScore: 1,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2026 14:251,16111,813,0112,903,0000524,288
2Nov 6, 2026 14:251,23612,012,4683,091,0000524,288
3Nov 6, 2026 14:251,24012,053,4643,100,0000524,288
4Nov 6, 2026 14:251,25412,007,6263,136,0000524,288
5Nov 6, 2026 14:251,25912,033,0273,149,0000524,288
6Nov 6, 2026 14:251,26212,048,6883,157,0000524,288
7Nov 6, 2026 14:251,26311,976,7923,159,0000524,288
8Nov 6, 2026 14:251,28712,115,9903,219,0000524,288
9Nov 6, 2026 14:251,34212,270,7343,355,0000524,288