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 listJan 18, 2025 04:00Ian MckibbenIan MckibbenScore: 1,264,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 04:001,262,2063,178,431,5783,153,517,0001,999,0002,338,816
2Jan 18, 2025 04:001,262,2183,179,194,5913,153,546,0001,999,0002,285,568
3Jan 18, 2025 04:001,262,4783,184,508,1153,155,197,000999,0002,293,760
4Jan 18, 2025 04:001,262,7633,186,958,9413,153,910,0002,998,0002,285,568
5Jan 18, 2025 04:001,264,4083,189,096,1333,160,022,000999,0002,293,760
6Jan 18, 2025 04:001,265,1743,187,804,8103,160,937,0001,998,0002,289,664
7Jan 18, 2025 04:001,265,3163,194,450,0743,162,290,000999,0002,293,760
8Jan 18, 2025 04:001,266,1053,191,209,5253,163,265,0001,998,0002,285,568
9Jan 18, 2025 04:001,266,3973,194,283,9303,164,994,000999,0002,285,568