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 12, 2024 23:46Joad NacerJoad NacerScore: 32,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 23:4632,625111,715,74181,562,00002,404,352
2Dec 12, 2024 23:4632,648104,131,54681,621,00002,330,624
3Dec 12, 2024 23:4632,659102,311,26281,647,00002,387,968
4Dec 12, 2024 23:4632,690108,946,05181,726,00002,433,024
5Dec 12, 2024 23:4632,738106,119,31577,852,0003,992,0002,387,968
6Dec 12, 2024 23:4632,742111,840,11078,862,0002,994,0002,310,144
7Dec 12, 2024 23:4632,790106,454,71778,976,0002,999,0002,441,216
8Dec 12, 2024 23:4632,826108,563,95082,065,00002,375,680
9Dec 12, 2024 23:4632,888104,977,90482,219,00002,453,504