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 00:54Tomislav TunkovicTomislav TunkovicScore: 1,552Success
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:111,42520,100,9643,563,0000524,288
2Aug 31, 2026 01:111,47911,957,7583,699,0000524,288
3Aug 31, 2026 01:111,51621,594,7773,792,0000524,288
4Aug 31, 2026 01:111,54817,777,3083,872,0000524,288
5Aug 31, 2026 01:111,55220,639,4463,881,0000524,288
6Aug 31, 2026 01:111,58119,787,8282,859,0001,094,000524,288
7Aug 31, 2026 01:111,59820,813,3632,967,0001,030,000524,288
8Aug 31, 2026 01:111,63823,693,9912,933,0001,164,000524,288
9Aug 31, 2026 01:111,64621,702,0382,963,0001,152,000524,288