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 9, 2026 21:57highload-churnerhighload-churnerScore: 6,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:555,98025,467,00312,768,0002,183,0002,117,632
2Oct 9, 2026 22:555,99325,590,52212,851,0002,132,0002,117,632
3Oct 9, 2026 22:556,03425,644,38312,923,0002,164,0002,117,632
4Oct 9, 2026 22:556,04225,651,76712,942,0002,163,0002,117,632
5Oct 9, 2026 22:556,07825,772,68413,032,0002,163,0002,117,632
6Oct 9, 2026 22:556,12426,436,87613,150,0002,160,0002,117,632
7Oct 9, 2026 22:556,14436,552,71713,185,0002,176,0002,117,632
8Oct 9, 2026 22:556,16828,604,44113,244,0002,178,0002,117,632
9Oct 9, 2026 22:556,19426,686,65813,290,0002,195,0002,117,632