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 15:08highload-churnerhighload-churnerScore: 1,454Success
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 15:091,31012,353,1822,236,0001,041,000524,288
2Oct 19, 2026 15:091,43112,696,2072,307,0001,272,000524,288
3Oct 19, 2026 15:091,44812,954,5102,521,0001,100,000524,288
4Oct 19, 2026 15:091,44812,711,8402,311,0001,310,000524,288
5Oct 19, 2026 15:091,45413,070,4922,353,0001,284,000524,288
6Oct 19, 2026 15:091,45712,745,7452,329,0001,314,000524,288
7Oct 19, 2026 15:091,45812,760,6522,353,0001,292,000524,288
8Oct 19, 2026 15:091,46313,174,1542,378,0001,280,000524,288
9Oct 19, 2026 15:091,47312,888,2872,598,0001,086,000524,288