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 30, 2026 16:37Tomislav TunkovicTomislav TunkovicScore: 1,662Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 16:371,52412,173,1513,811,0000524,288
2Aug 30, 2026 16:371,53412,089,6573,836,0000524,288
3Aug 30, 2026 16:371,53612,105,1463,840,0000524,288
4Aug 30, 2026 16:371,64613,846,9894,117,0000524,288
5Aug 30, 2026 16:371,66212,452,2394,155,0000524,288
6Aug 30, 2026 16:371,66312,266,5474,158,0000524,288
7Aug 30, 2026 16:371,66612,539,4134,165,0000524,288
8Aug 30, 2026 16:371,66812,453,3534,172,0000524,288
9Aug 30, 2026 16:371,67512,278,2634,188,0000524,288