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 listOct 7, 2024 20:53Joad NacerJoad NacerScore: 1,299,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 20:531,299,7423,278,001,7563,247,358,0001,998,0002,314,240
2Oct 7, 2024 20:531,299,9583,277,549,7973,247,898,0001,998,0002,306,048
3Oct 7, 2024 20:531,305,5493,297,446,1933,260,875,0002,997,0002,289,664