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 listMar 24, 2026 03:51olliecrowolliecrowScore: 7,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 03:516,86643,483,26515,147,0002,019,0002,310,144
2Mar 24, 2026 03:516,88442,763,04315,186,0002,024,0002,416,640
3Mar 24, 2026 03:516,93038,147,67515,288,0002,038,0002,269,184
4Mar 24, 2026 03:516,96839,607,10816,396,0001,024,0002,416,640
5Mar 24, 2026 03:517,16442,548,67317,909,00002,404,352
6Mar 24, 2026 03:517,17639,932,96713,954,0003,986,0002,408,448
7Mar 24, 2026 03:517,18842,555,54114,976,0002,995,0002,392,064
8Mar 24, 2026 03:517,22739,567,80216,060,0002,007,0002,408,448
9Mar 24, 2026 03:517,35341,397,47217,362,0001,021,0002,269,184