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 6, 2024 07:03Mikhail ShirokovMikhail ShirokovScore: 700,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 07:03700,2391,775,130,3351,747,601,0002,997,0002,322,432
2Nov 6, 2024 07:03700,3281,780,858,5811,749,821,000999,0002,322,432
3Nov 6, 2024 07:03700,4521,773,783,0681,748,131,0002,998,0002,322,432
4Nov 6, 2024 07:03700,6561,781,371,6761,749,643,0001,998,0002,392,064
5Nov 6, 2024 07:03700,8841,775,621,4061,751,211,000999,0002,277,376
6Nov 6, 2024 07:03700,9461,774,988,6741,750,365,0001,999,0002,322,432
7Nov 6, 2024 07:03701,0751,782,791,1271,751,689,000999,0002,322,432
8Nov 6, 2024 07:03701,0781,779,593,1881,750,696,0001,998,0002,326,528
9Nov 6, 2024 07:03701,1151,776,717,8801,751,789,000999,0002,322,432