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:39Tomislav TunkovicTomislav TunkovicScore: 1,438Success
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:421,38111,664,0573,453,0000524,288
2Aug 31, 2026 00:421,38211,573,2153,457,0000524,288
3Aug 31, 2026 00:421,38411,619,1943,460,0000524,288
4Aug 31, 2026 00:421,39111,717,5073,479,0000524,288
5Aug 31, 2026 00:421,43811,729,4093,595,0000524,288
6Aug 31, 2026 00:421,51111,901,1583,779,0000524,288
7Aug 31, 2026 00:421,52611,936,5083,816,0000524,288
8Aug 31, 2026 00:421,53511,992,0893,838,0000524,288
9Aug 31, 2026 00:421,54211,967,7973,857,0000524,288