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 15:13Sybrand AarnoutseSybrand AarnoutseScore: 1,268,390Success
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 15:131,267,6363,199,907,3283,168,090,000999,0002,412,544
2Oct 17, 2024 15:131,267,9253,195,109,0583,168,813,000999,0002,416,640
3Oct 17, 2024 15:131,268,1803,199,225,9993,169,452,000999,0002,293,760
4Oct 17, 2024 15:131,268,3343,207,082,1413,168,837,0001,998,0002,285,568
5Oct 17, 2024 15:131,268,3903,201,927,8223,169,976,000999,0002,408,448
6Oct 17, 2024 15:131,268,7903,204,152,2403,171,974,00002,293,760
7Oct 17, 2024 15:131,269,4093,203,613,0903,172,523,000999,0002,420,736
8Oct 17, 2024 15:131,270,1513,204,313,5523,173,380,0001,998,0002,289,664
9Oct 17, 2024 15:131,270,1623,201,714,0883,174,405,000999,0002,293,760