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:16highload-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 06:161,17712,045,2751,698,0001,245,000524,288
2Nov 8, 2026 06:161,17812,051,2691,703,0001,242,000524,288
3Nov 8, 2026 06:161,19812,208,0171,769,0001,226,000524,288
4Nov 8, 2026 06:161,30412,365,8992,021,0001,241,000524,288
5Nov 8, 2026 06:161,33812,550,7682,283,0001,063,000524,288
6Nov 8, 2026 06:161,34812,588,8942,063,0001,309,000524,288
7Nov 8, 2026 06:161,36912,495,7272,173,0001,250,000524,288
8Nov 8, 2026 06:161,37213,436,9182,170,0001,261,000524,288
9Nov 8, 2026 06:161,39312,970,4022,172,0001,311,000524,288