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 listDec 8, 2024 06:50E SequeiraE SequeiraScore: 312,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 06:50311,857806,431,076777,644,0001,999,0002,289,664
2Dec 8, 2024 06:49311,960803,381,385776,900,0002,999,0002,285,568
3Dec 8, 2024 06:50311,969804,043,070776,923,0002,999,0002,281,472
4Dec 8, 2024 06:49312,048806,718,017779,120,0001,000,0002,285,568
5Dec 8, 2024 06:50312,217808,697,157778,544,0001,998,0002,289,664
6Dec 8, 2024 06:49312,304804,212,575777,762,0002,999,0002,281,472
7Dec 8, 2024 06:50312,551806,746,130778,381,0002,997,0002,289,664
8Dec 8, 2024 06:50312,622809,591,354777,557,0003,997,0002,273,280
9Dec 8, 2024 06:50312,835811,429,938779,087,0003,000,0002,260,992