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:23Tomislav TunkovicTomislav TunkovicScore: 1,537Success
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 00:271,43811,773,2663,595,0000524,288
2Aug 31, 2026 00:271,50111,955,6783,753,0000524,288
3Aug 31, 2026 00:271,51711,916,5913,794,0000524,288
4Aug 31, 2026 00:271,53512,023,7873,838,0000524,288
5Aug 31, 2026 00:271,53713,303,1633,843,0000524,288
6Aug 31, 2026 00:271,53712,531,5223,844,0000524,288
7Aug 31, 2026 00:271,54012,053,2393,852,0000524,288
8Aug 31, 2026 00:271,54211,982,7813,856,0000524,288
9Aug 31, 2026 00:271,54212,015,4443,856,0000524,288