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 listApr 25, 2026 06:20olliecrowolliecrowScore: 4,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:244,45327,936,6308,097,0003,036,0002,392,064
2Apr 25, 2026 06:244,46837,254,5559,140,0002,031,0002,347,008
3Apr 25, 2026 06:244,47026,568,0409,144,0002,032,0002,404,352
4Apr 25, 2026 06:244,47231,872,1918,131,0003,049,0002,400,256
5Apr 25, 2026 06:244,48426,299,7049,172,0002,038,0002,392,064
6Apr 25, 2026 06:244,61029,347,9908,383,0003,143,0002,383,872
7Apr 25, 2026 06:244,70428,205,3199,801,0001,960,0002,396,160
8Apr 25, 2026 06:244,74329,769,4579,882,0001,976,0002,396,160
9Apr 25, 2026 06:244,91733,851,5479,221,0003,073,0002,400,256