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 8, 2026 10:31highload-churnerhighload-churnerScore: 1,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 10:321,11511,907,9711,790,000998,000524,288
2Nov 8, 2026 10:321,15011,873,9932,877,0000524,288
3Nov 8, 2026 10:321,28212,212,6482,154,0001,052,000524,288
4Nov 8, 2026 10:321,28712,283,3942,167,0001,051,000524,288
5Nov 8, 2026 10:321,29212,277,8912,180,0001,050,000524,288
6Nov 8, 2026 10:321,29912,355,6792,196,0001,052,000524,288
7Nov 8, 2026 10:321,30412,347,9551,988,0001,274,000524,288
8Nov 8, 2026 10:321,30412,314,7612,202,0001,059,000524,288
9Nov 8, 2026 10:321,32812,709,3801,842,0001,479,000524,288