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:52Tomislav TunkovicTomislav TunkovicScore: 1,385Success
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:531,38111,403,3493,454,0000524,288
2Aug 31, 2026 01:531,38211,388,0423,457,0000524,288
3Aug 31, 2026 01:531,38411,389,1013,461,0000524,288
4Aug 31, 2026 01:531,38411,447,7533,462,0000524,288
5Aug 31, 2026 01:531,38511,420,8213,463,0000524,288
6Aug 31, 2026 01:531,38611,509,4073,465,0000524,288
7Aug 31, 2026 01:531,39011,478,9903,477,0000524,288
8Aug 31, 2026 01:531,53611,797,2463,841,0000524,288
9Aug 31, 2026 01:531,60021,801,8882,880,0001,120,000524,288