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:53marko1597marko1597Score: 1,820Success
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 19:171,78612,897,4723,248,0001,219,0002,117,632
2Aug 14, 2026 19:171,79412,814,7253,261,0001,224,0002,117,632
3Aug 14, 2026 19:171,79712,775,5363,267,0001,226,0002,117,632
4Aug 14, 2026 19:171,79812,702,1703,271,0001,226,0002,117,632
5Aug 14, 2026 19:171,82014,259,7603,401,0001,151,0002,117,632
6Aug 14, 2026 19:171,93112,967,4673,655,0001,173,0002,117,632
7Aug 14, 2026 19:171,93313,033,2083,642,0001,192,0002,117,632
8Aug 14, 2026 19:171,95913,037,6443,737,0001,161,0002,117,632
9Aug 14, 2026 19:171,97313,188,7993,735,0001,199,0002,117,632