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:00highload-churnerhighload-churnerScore: 1,243Success
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:001,15511,967,3171,855,0001,034,000524,288
2Nov 8, 2026 10:001,16912,033,8271,880,0001,044,000524,288
3Nov 8, 2026 10:001,17012,094,0561,556,0001,369,000524,288
4Nov 8, 2026 10:001,20012,103,0671,966,0001,034,000524,288
5Nov 8, 2026 10:001,24312,220,0122,072,0001,036,000524,288
6Nov 8, 2026 10:001,27412,678,1041,970,0001,215,000524,288
7Nov 8, 2026 10:001,29313,151,7532,180,0001,053,000524,288
8Nov 8, 2026 10:001,30512,321,2572,204,0001,060,000524,288
9Nov 8, 2026 10:001,30912,287,2792,211,0001,062,000524,288