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 10, 2024 23:40Joad NacerJoad NacerScore: 32,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 10, 2024 23:4032,891107,664,20281,225,0001,002,0002,285,568
2Dec 10, 2024 23:4032,913105,059,20481,280,0001,003,0002,310,144
3Dec 10, 2024 23:4032,921107,021,69182,303,00002,334,720
4Dec 10, 2024 23:4032,953107,408,91382,383,00002,428,928
5Dec 10, 2024 23:4032,963104,964,53282,408,00002,408,448
6Dec 10, 2024 23:4032,974111,414,94480,426,0002,010,0002,359,296
7Dec 10, 2024 23:4032,978107,212,26282,446,00002,355,200
8Dec 10, 2024 23:4032,987112,503,82881,462,0001,005,0002,510,848
9Dec 10, 2024 23:4033,029105,004,16182,572,00002,506,752