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 07:21highload-churnerhighload-churnerScore: 1,338Success
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 07:221,13512,022,5071,654,0001,185,000524,288
2Nov 8, 2026 07:221,20012,113,9371,749,0001,251,000524,288
3Nov 8, 2026 07:221,23812,305,4901,877,0001,218,000524,288
4Nov 8, 2026 07:221,33312,428,4892,289,0001,044,000524,288
5Nov 8, 2026 07:221,33812,429,5702,113,0001,234,000524,288
6Nov 8, 2026 07:221,34412,471,6042,103,0001,258,000524,288
7Nov 8, 2026 07:221,35712,482,0532,346,0001,048,000524,288
8Nov 8, 2026 07:221,35912,443,9452,175,0001,224,000524,288
9Nov 8, 2026 07:221,36412,434,4722,160,0001,251,000524,288