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 20, 2025 16:04Oleg KovalovOleg KovalovScore: 1,112,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 16:041,110,8852,804,957,1372,776,214,000999,0002,379,776
2Jan 20, 2025 16:041,111,6762,810,271,5602,776,191,0002,998,0002,371,584
3Jan 20, 2025 16:041,111,7632,811,801,4032,777,409,0001,998,0002,371,584
4Jan 20, 2025 16:041,112,0132,810,742,5372,777,035,0002,997,0002,379,776
5Jan 20, 2025 16:041,112,1012,811,751,8102,778,254,0001,998,0002,293,760
6Jan 20, 2025 16:041,112,2482,811,264,5922,778,622,0001,999,0002,379,776
7Jan 20, 2025 16:041,112,6722,808,385,2112,779,680,0001,999,0002,371,584
8Jan 20, 2025 16:041,113,2892,811,260,8902,781,225,0001,998,0002,375,680
9Jan 20, 2025 16:041,113,4682,809,986,8862,781,672,0001,998,0002,375,680