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 17, 2024 14:36Sybrand AarnoutseSybrand AarnoutseScore: 1,268,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2024 14:361,266,9933,194,703,7053,166,483,000999,0002,412,544
2Oct 17, 2024 14:361,268,1423,198,966,7183,168,358,0001,998,0002,285,568
3Oct 17, 2024 14:361,268,4423,200,926,2863,171,105,00002,285,568
4Oct 17, 2024 14:361,268,5133,197,287,8613,169,284,0001,998,0002,285,568
5Oct 17, 2024 14:361,268,5693,198,785,2173,170,423,000999,0002,285,568
6Oct 17, 2024 14:361,268,6843,200,153,0323,171,709,00002,293,760
7Oct 17, 2024 14:361,269,1713,204,103,7583,171,929,000999,0002,293,760
8Oct 17, 2024 14:361,269,5903,201,867,1123,171,977,0001,998,0002,289,664
9Oct 17, 2024 14:361,269,6813,207,949,7733,172,204,0001,998,0002,293,760