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:12Tomislav TunkovicTomislav TunkovicScore: 1,532Success
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:241,39115,113,0823,478,0000524,288
2Aug 31, 2026 01:241,48111,848,6233,703,0000524,288
3Aug 31, 2026 01:241,48313,209,2293,709,0000524,288
4Aug 31, 2026 01:241,53012,000,4173,827,0000524,288
5Aug 31, 2026 01:241,53213,326,3833,830,0000524,288
6Aug 31, 2026 01:241,53211,963,2423,832,0000524,288
7Aug 31, 2026 01:241,53518,101,9313,838,0000524,288
8Aug 31, 2026 01:241,53612,022,0263,842,0000524,288
9Aug 31, 2026 01:241,53912,058,3883,848,0000524,288