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:25marko1597marko1597Score: 1,813Success
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:361,77213,289,2973,212,0001,220,0002,117,632
2Aug 14, 2026 18:361,77612,589,2553,203,0001,238,0002,117,632
3Aug 14, 2026 18:361,78412,637,6443,222,0001,240,0002,117,632
4Aug 14, 2026 18:361,80012,829,8833,011,0001,491,0002,117,632
5Aug 14, 2026 18:361,81312,934,4713,270,0001,263,0002,117,632
6Aug 14, 2026 18:361,92913,016,6183,674,0001,149,0002,117,632
7Aug 14, 2026 18:361,93413,179,0783,544,0001,292,0002,117,632
8Aug 14, 2026 18:361,94613,055,2923,698,0001,167,0002,117,632
9Aug 14, 2026 18:361,95613,086,2773,695,0001,197,0002,117,632