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 15, 2026 22:30marko1597marko1597Score: 1,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:461,58612,385,3542,823,0001,144,0002,113,536
2Aug 15, 2026 22:461,59012,454,7122,809,0001,167,0002,113,536
3Aug 15, 2026 22:461,61612,444,4552,875,0001,167,0002,113,536
4Aug 15, 2026 22:461,62012,489,0592,860,0001,190,0002,113,536
5Aug 15, 2026 22:461,69412,665,1553,021,0001,215,0002,113,536
6Aug 15, 2026 22:461,74212,686,4153,149,0001,208,0002,113,536
7Aug 15, 2026 22:461,74512,729,2013,132,0001,231,0002,113,536
8Aug 15, 2026 22:461,75012,768,1383,155,0001,221,0002,113,536
9Aug 15, 2026 22:461,82222,489,0633,462,0001,094,0002,113,536