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 9, 2026 01:13highload-churnerhighload-churnerScore: 1,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2026 01:131,10711,911,8052,768,0000524,288
2Nov 9, 2026 01:131,13411,924,8202,836,0000524,288
3Nov 9, 2026 01:131,23212,166,2882,034,0001,047,000524,288
4Nov 9, 2026 01:131,23612,185,5942,077,0001,015,000524,288
5Nov 9, 2026 01:131,27212,223,3582,142,0001,038,000524,288
6Nov 9, 2026 01:131,27512,631,7822,148,0001,040,000524,288
7Nov 9, 2026 01:131,28812,231,4781,790,0001,432,000524,288
8Nov 9, 2026 01:131,29912,323,8812,178,0001,071,000524,288
9Nov 9, 2026 01:131,33912,334,3161,833,0001,515,000524,288