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 06:31highload-churnerhighload-churnerScore: 1,195Success
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 06:321,16012,077,3192,902,0000524,288
2Nov 8, 2026 06:321,16111,995,6671,658,0001,246,000524,288
3Nov 8, 2026 06:321,16212,125,2341,688,0001,217,000524,288
4Nov 8, 2026 06:321,16612,085,2211,689,0001,228,000524,288
5Nov 8, 2026 06:321,19512,172,1741,542,0001,447,000524,288
6Nov 8, 2026 06:321,24112,177,4641,881,0001,223,000524,288
7Nov 8, 2026 06:321,28912,335,2541,892,0001,331,000524,288
8Nov 8, 2026 06:321,31312,430,8482,087,0001,197,000524,288
9Nov 8, 2026 06:321,39212,529,6852,260,0001,221,000524,288