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 07:01highload-churnerhighload-churnerScore: 1,319Success
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 07:011,14612,085,1261,516,0001,349,000524,288
2Nov 8, 2026 07:011,16212,009,3571,589,0001,317,000524,288
3Nov 8, 2026 07:011,27912,306,6712,144,0001,054,000524,288
4Nov 8, 2026 07:011,29612,428,4472,232,0001,009,000524,288
5Nov 8, 2026 07:011,31912,406,6052,249,0001,050,000524,288
6Nov 8, 2026 07:011,34712,449,0202,317,0001,051,000524,288
7Nov 8, 2026 07:011,37612,512,0462,396,0001,044,000524,288
8Nov 8, 2026 07:011,40312,631,6002,461,0001,048,000524,288
9Nov 8, 2026 07:011,42312,655,7152,061,0001,497,000524,288