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 31, 2026 01:23Tomislav TunkovicTomislav TunkovicScore: 1,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:331,52512,088,9393,814,0000524,288
2Aug 31, 2026 01:331,52812,075,3853,820,0000524,288
3Aug 31, 2026 01:331,52912,095,8033,824,0000524,288
4Aug 31, 2026 01:331,53212,113,8643,830,0000524,288
5Aug 31, 2026 01:331,53512,149,3153,838,0000524,288
6Aug 31, 2026 01:331,53712,174,7473,843,0000524,288
7Aug 31, 2026 01:331,53812,122,7723,846,0000524,288
8Aug 31, 2026 01:331,54112,706,1623,854,0000524,288
9Aug 31, 2026 01:331,54312,244,7123,859,0000524,288