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 29, 2026 11:25Victor MerckléVictor MerckléScore: 1,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:271,59412,249,8322,892,0001,095,0002,117,632stderr
2Aug 29, 2026 11:271,59612,323,6312,889,0001,102,0002,117,632stderr
3Aug 29, 2026 11:271,59812,307,8602,887,0001,110,0002,117,632stderr
4Aug 29, 2026 11:271,59812,320,8812,890,0001,106,0002,117,632stderr
5Aug 29, 2026 11:271,63812,504,4882,873,0001,223,0002,117,632stderr
6Aug 29, 2026 11:271,67412,586,1663,034,0001,151,0002,117,632stderr
7Aug 29, 2026 11:271,67712,614,1883,082,0001,111,0002,117,632stderr
8Aug 29, 2026 11:271,72712,755,9243,172,0001,146,0002,117,632stderr
9Aug 29, 2026 11:271,75312,810,3453,206,0001,177,0002,117,632stderr