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 09:33highload-churnerhighload-churnerScore: 1,302Success
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 09:331,15012,356,4771,848,0001,027,000524,288
2Nov 8, 2026 09:331,27512,344,5282,165,0001,023,000524,288
3Nov 8, 2026 09:331,28612,284,7852,189,0001,026,000524,288
4Nov 8, 2026 09:331,29112,392,9312,188,0001,040,000524,288
5Nov 8, 2026 09:331,30212,304,3362,191,0001,066,000524,288
6Nov 8, 2026 09:331,30212,343,7732,198,0001,057,000524,288
7Nov 8, 2026 09:331,30312,377,8872,217,0001,041,000524,288
8Nov 8, 2026 09:331,31112,320,0872,210,0001,069,000524,288
9Nov 8, 2026 09:331,32012,527,9072,175,0001,125,000524,288