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 14:12highload-churnerhighload-churnerScore: 1,541Success
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 14:121,25212,312,1012,061,0001,069,000524,288
2Oct 19, 2026 14:121,41812,616,4332,440,0001,106,000524,288
3Oct 19, 2026 14:121,43713,482,7552,520,0001,074,000524,288
4Oct 19, 2026 14:121,52012,923,7472,699,0001,103,000524,288
5Oct 19, 2026 14:121,54112,932,6632,742,0001,112,000524,288
6Oct 19, 2026 14:121,54313,461,2052,759,0001,100,000524,288
7Oct 19, 2026 14:121,55213,406,8812,791,0001,089,000524,288
8Oct 19, 2026 14:121,56013,059,6722,781,0001,119,000524,288
9Oct 19, 2026 14:121,59413,044,5412,873,0001,114,000524,288