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 listOct 19, 2026 14:49highload-churnerhighload-churnerScore: 1,467Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 14:501,43112,746,3782,493,0001,086,000524,288
2Oct 19, 2026 14:501,44412,468,4532,542,0001,070,000524,288
3Oct 19, 2026 14:501,46212,691,6752,556,0001,101,000524,288
4Oct 19, 2026 14:501,46412,772,2672,555,0001,105,000524,288
5Oct 19, 2026 14:501,46712,722,4402,555,0001,113,000524,288
6Oct 19, 2026 14:501,48313,223,3632,596,0001,113,000524,288
7Oct 19, 2026 14:501,48413,240,0192,630,0001,082,000524,288
8Oct 19, 2026 14:501,49412,842,5202,613,0001,122,000524,288
9Oct 19, 2026 14:501,54812,997,2202,746,0001,125,000524,288