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:58Tomislav TunkovicTomislav TunkovicScore: 1,534Success
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:091,38111,748,3953,454,0000524,288
2Aug 31, 2026 02:091,38111,688,1943,454,0000524,288
3Aug 31, 2026 02:091,38811,650,6533,471,0000524,288
4Aug 31, 2026 02:091,47611,863,9773,691,0000524,288
5Aug 31, 2026 02:091,53412,000,5803,837,0000524,288
6Aug 31, 2026 02:091,53811,974,5813,847,0000524,288
7Aug 31, 2026 02:091,53812,014,7693,846,0000524,288
8Aug 31, 2026 02:091,53813,295,2673,847,0000524,288
9Aug 31, 2026 02:091,56212,086,1203,907,0000524,288