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:40highload-churnerhighload-churnerScore: 1,533Success
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:401,39612,709,1712,394,0001,097,000524,288
2Oct 19, 2026 13:401,46212,911,7392,622,0001,033,000524,288
3Oct 19, 2026 13:401,50912,864,5052,683,0001,091,000524,288
4Oct 19, 2026 13:401,51513,398,6692,725,0001,064,000524,288
5Oct 19, 2026 13:401,53313,431,1822,745,0001,089,000524,288
6Oct 19, 2026 13:401,55013,038,1282,777,0001,098,000524,288
7Oct 19, 2026 13:401,55615,068,3112,798,0001,093,000524,288
8Oct 19, 2026 13:401,56213,012,0062,786,0001,119,000524,288
9Oct 19, 2026 13:401,58113,496,2652,839,0001,115,000524,288