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 14, 2026 18:46marko1597marko1597Score: 1,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:501,83213,034,3963,331,0001,249,0002,117,632
2Aug 14, 2026 18:501,83712,810,9323,323,0001,270,0002,117,632
3Aug 14, 2026 18:501,89313,126,4903,585,0001,148,0002,117,632
4Aug 14, 2026 18:501,90813,212,8933,632,0001,139,0002,117,632
5Aug 14, 2026 18:501,95413,032,9513,736,0001,150,0002,117,632
6Aug 14, 2026 18:501,96813,147,4853,756,0001,164,0002,117,632
7Aug 14, 2026 18:501,97114,060,9083,774,0001,154,0002,117,632
8Aug 14, 2026 18:501,97214,042,7493,767,0001,165,0002,117,632
9Aug 14, 2026 18:501,97613,341,3743,752,0001,189,0002,117,632