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 08:31highload-churnerhighload-churnerScore: 1,330Success
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 08:321,11611,918,1511,611,0001,180,000524,288
2Nov 8, 2026 08:321,11911,989,8801,609,0001,189,000524,288
3Nov 8, 2026 08:321,15212,393,3421,658,0001,223,000524,288
4Nov 8, 2026 08:321,31012,448,7232,247,0001,028,000524,288
5Nov 8, 2026 08:321,33014,367,0282,100,0001,227,000524,288
6Nov 8, 2026 08:321,33112,383,3172,092,0001,237,000524,288
7Nov 8, 2026 08:321,34312,359,6312,126,0001,232,000524,288
8Nov 8, 2026 08:321,34812,347,9752,302,0001,068,000524,288
9Nov 8, 2026 08:321,40912,645,2162,132,0001,391,000524,288