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 18, 2024 15:37Sybrand AarnoutseSybrand AarnoutseScore: 1,268,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 15:371,267,7213,200,160,7333,168,303,000999,0002,285,568
2Oct 18, 2024 15:371,267,9853,201,486,0893,167,964,0001,998,0002,289,664
3Oct 18, 2024 15:371,268,1323,194,575,4253,169,331,000999,0002,293,760
4Oct 18, 2024 15:371,268,1363,198,907,2293,168,341,0001,998,0002,285,568
5Oct 18, 2024 15:371,268,4803,205,050,3143,169,201,0001,998,0002,285,568
6Oct 18, 2024 15:371,268,5583,199,606,8143,170,396,000999,0002,285,568
7Oct 18, 2024 15:371,269,9743,202,063,3833,172,936,0001,998,0002,408,448
8Oct 18, 2024 15:371,270,0863,201,592,5313,174,217,000999,0002,412,544
9Oct 18, 2024 15:371,270,6883,202,076,5343,175,720,000999,0002,293,760