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 23:53marko1597marko1597Score: 1,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 00:201,61012,571,0752,882,0001,144,0002,113,536
2Aug 16, 2026 00:201,63612,447,8372,902,0001,188,0002,113,536
3Aug 16, 2026 00:201,64212,510,6262,901,0001,206,0002,113,536
4Aug 16, 2026 00:201,65612,585,8472,943,0001,197,0002,113,536
5Aug 16, 2026 00:201,67319,794,1972,973,0001,211,0002,113,536
6Aug 16, 2026 00:201,70812,898,4923,054,0001,217,0002,113,536
7Aug 16, 2026 00:201,71512,659,2873,052,0001,236,0002,113,536
8Aug 16, 2026 00:201,72212,668,7733,099,0001,206,0002,113,536
9Aug 16, 2026 00:201,75812,807,0963,168,0001,228,0002,113,536