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:15marko1597marko1597Score: 1,699Success
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 23:331,60212,499,0062,844,0001,161,0002,113,536
2Aug 15, 2026 23:331,61512,488,4392,870,0001,168,0002,113,536
3Aug 15, 2026 23:331,62112,453,1422,874,0001,180,0002,113,536
4Aug 15, 2026 23:331,66612,519,2012,961,0001,204,0002,113,536
5Aug 15, 2026 23:331,69912,583,6683,017,0001,231,0002,113,536
6Aug 15, 2026 23:331,72813,270,9063,099,0001,221,0002,113,536
7Aug 15, 2026 23:331,73712,666,1143,128,0001,216,0002,113,536
8Aug 15, 2026 23:331,74112,699,4703,134,0001,220,0002,113,536
9Aug 15, 2026 23:331,75012,695,0743,166,0001,211,0002,113,536