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 17, 2025 06:04Yuriy LyfenkoYuriy LyfenkoScore: 39,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 06:0439,592129,639,96491,982,0006,998,0002,482,176
2Nov 17, 2025 06:0439,598127,182,74890,997,0007,999,0002,347,008
3Nov 17, 2025 06:0439,757124,987,67891,361,0008,031,0002,486,272
4Nov 17, 2025 06:0439,794129,672,56994,462,0005,024,0002,322,432
5Nov 17, 2025 06:0439,930125,187,22390,841,0008,984,0002,334,720
6Nov 17, 2025 06:0439,930123,227,41193,837,0005,989,0002,281,472
7Nov 17, 2025 06:0439,967125,676,52490,926,0008,992,0002,473,984
8Nov 17, 2025 06:0440,030125,460,03892,070,0008,006,0002,404,352
9Nov 17, 2025 06:0440,039131,172,26093,091,0007,006,0002,281,472