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:40highload-churnerhighload-churnerScore: 1,434Success
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:401,18812,142,5491,725,0001,246,000524,288
2Oct 19, 2026 15:401,29212,499,7662,009,0001,221,000524,288
3Oct 19, 2026 15:401,40712,727,9012,237,0001,281,000524,288
4Oct 19, 2026 15:401,42013,259,2672,256,0001,294,000524,288
5Oct 19, 2026 15:401,43412,719,4872,308,0001,277,000524,288
6Oct 19, 2026 15:401,45213,206,2562,370,0001,261,000524,288
7Oct 19, 2026 15:401,47013,223,9142,541,0001,136,000524,288
8Oct 19, 2026 15:401,48412,775,5132,392,0001,320,000524,288
9Oct 19, 2026 15:401,48813,260,3692,646,0001,074,000524,288