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:55highload-churnerhighload-churnerScore: 1,205Success
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:561,12412,017,8681,815,000996,000524,288
2Nov 8, 2026 06:561,13212,032,7851,828,0001,003,000524,288
3Nov 8, 2026 06:561,15811,992,7432,896,0000524,288
4Nov 8, 2026 06:561,16111,925,5631,676,0001,228,000524,288
5Nov 8, 2026 06:561,20512,091,6321,961,0001,052,000524,288
6Nov 8, 2026 06:561,31412,372,3002,238,0001,049,000524,288
7Nov 8, 2026 06:561,34612,842,3022,319,0001,046,000524,288
8Nov 8, 2026 06:561,36414,176,5202,362,0001,050,000524,288
9Nov 8, 2026 06:561,37412,482,1972,394,0001,043,000524,288