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 12:56highload-churnerhighload-churnerScore: 1,576Success
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 12:561,37812,692,0712,316,0001,130,000524,288
2Oct 19, 2026 12:561,42912,812,6692,436,0001,138,000524,288
3Oct 19, 2026 12:561,54613,184,6902,720,0001,145,000524,288
4Oct 19, 2026 12:561,54713,175,2112,794,0001,075,000524,288
5Oct 19, 2026 12:561,57613,179,8872,840,0001,101,000524,288
6Oct 19, 2026 12:561,58713,378,2142,886,0001,082,000524,288
7Oct 19, 2026 12:561,59713,395,0282,889,0001,104,000524,288
8Oct 19, 2026 12:561,64513,348,6532,994,0001,119,000524,288
9Oct 19, 2026 12:561,65713,361,7763,027,0001,117,000524,288