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 listNov 15, 2024 10:13Mikhail ShirokovMikhail ShirokovScore: 377,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 10:13377,144970,590,068940,861,0001,999,0002,293,760
2Nov 15, 2024 10:13377,200967,479,009942,999,00002,424,832
3Nov 15, 2024 10:13377,220974,902,724943,051,00002,293,760
4Nov 15, 2024 10:13377,227964,979,136943,068,00002,424,832
5Nov 15, 2024 10:13377,228965,995,744943,069,00002,285,568
6Nov 15, 2024 10:13377,228973,595,758942,071,000999,0002,363,392
7Nov 15, 2024 10:13377,241967,079,027941,105,0001,998,0002,293,760
8Nov 15, 2024 10:13377,246972,280,136942,114,0001,000,0002,293,760
9Nov 15, 2024 10:13377,301975,353,107942,253,000999,0002,531,328