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 20, 2026 00:26highload-churnerhighload-churnerScore: 1,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 00:271,15912,122,9791,642,0001,256,000524,288
2Oct 20, 2026 00:271,16512,102,7311,707,0001,207,000524,288
3Oct 20, 2026 00:271,18812,137,5161,716,0001,255,000524,288
4Oct 20, 2026 00:271,18812,533,3061,720,0001,252,000524,288
5Oct 20, 2026 00:271,21912,173,6271,792,0001,256,000524,288
6Oct 20, 2026 00:271,43012,805,5102,325,0001,251,000524,288
7Oct 20, 2026 00:271,43712,689,9322,497,0001,096,000524,288
8Oct 20, 2026 00:271,43912,777,6532,501,0001,097,000524,288
9Oct 20, 2026 00:271,46612,944,7952,390,0001,276,000524,288