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 08:23highload-churnerhighload-churnerScore: 1,338Success
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 08:231,28512,686,4052,010,0001,203,000524,288
2Nov 8, 2026 08:231,29112,368,5192,031,0001,198,000524,288
3Nov 8, 2026 08:231,32712,326,5712,091,0001,228,000524,288
4Nov 8, 2026 08:231,33012,757,9022,093,0001,234,000524,288
5Nov 8, 2026 08:231,33812,542,3362,013,0001,333,000524,288
6Nov 8, 2026 08:231,33813,112,5202,109,0001,238,000524,288
7Nov 8, 2026 08:231,34012,420,0132,127,0001,225,000524,288
8Nov 8, 2026 08:231,34112,384,5342,108,0001,245,000524,288
9Nov 8, 2026 08:231,37512,472,9692,209,0001,230,000524,288