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 listNov 8, 2026 06:29highload-churnerhighload-churnerScore: 1,349Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 06:291,14812,009,2901,521,0001,349,000524,288
2Nov 8, 2026 06:291,27212,331,1811,701,0001,479,000524,288
3Nov 8, 2026 06:291,32412,401,6512,266,0001,044,000524,288
4Nov 8, 2026 06:291,34312,463,3762,098,0001,260,000524,288
5Nov 8, 2026 06:291,34912,602,3562,340,0001,033,000524,288
6Nov 8, 2026 06:291,35812,489,0092,160,0001,235,000524,288
7Nov 8, 2026 06:291,37012,492,8712,200,0001,226,000524,288
8Nov 8, 2026 06:291,37712,691,5682,178,0001,265,000524,288
9Nov 8, 2026 06:291,37912,898,9152,401,0001,048,000524,288