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 13:22highload-churnerhighload-churnerScore: 1,569Success
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 13:221,32412,499,7112,004,0001,306,000524,288
2Oct 19, 2026 13:221,53012,932,1192,492,0001,333,000524,288
3Oct 19, 2026 13:221,54613,192,3512,530,0001,335,000524,288
4Oct 19, 2026 13:221,54812,999,5842,550,0001,322,000524,288
5Oct 19, 2026 13:221,56913,552,7442,562,0001,362,000524,288
6Oct 19, 2026 13:221,58013,078,7722,590,0001,361,000524,288
7Oct 19, 2026 13:221,59413,017,3762,915,0001,070,000524,288
8Oct 19, 2026 13:221,60813,144,1682,672,0001,348,000524,288
9Oct 19, 2026 13:221,63613,257,8553,033,0001,058,000524,288