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 02:05Tomislav TunkovicTomislav TunkovicScore: 1,486Success
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 02:201,37911,588,2213,449,0000524,288
2Aug 31, 2026 02:201,38311,617,1053,459,0000524,288
3Aug 31, 2026 02:201,38711,637,4133,468,0000524,288
4Aug 31, 2026 02:201,43411,713,3723,586,0000524,288
5Aug 31, 2026 02:201,48611,907,4773,715,0000524,288
6Aug 31, 2026 02:201,53211,938,9443,830,0000524,288
7Aug 31, 2026 02:201,53211,980,8313,831,0000524,288
8Aug 31, 2026 02:201,53912,097,3203,849,0000524,288
9Aug 31, 2026 02:201,54112,107,9993,853,0000524,288