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:23Tomislav TunkovicTomislav TunkovicScore: 1,653Success
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:291,53411,985,2193,835,0000524,288
2Aug 30, 2026 16:291,53511,942,1093,838,0000524,288
3Aug 30, 2026 16:291,54112,009,4063,854,0000524,288
4Aug 30, 2026 16:291,64712,220,8964,119,0000524,288
5Aug 30, 2026 16:291,65312,285,1954,133,0000524,288
6Aug 30, 2026 16:291,65912,248,9424,149,0000524,288
7Aug 30, 2026 16:291,66212,197,1044,156,0000524,288
8Aug 30, 2026 16:291,66512,212,4574,164,0000524,288
9Aug 30, 2026 16:291,66812,206,4444,170,0000524,288