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 listSep 26, 2026 13:05Kevin HeaveyKevin HeaveyScore: 1,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 13:051,26612,306,0483,167,0000524,288
2Sep 26, 2026 13:051,26711,660,9433,169,0000524,288
3Sep 26, 2026 13:051,26812,287,8243,172,0000524,288
4Sep 26, 2026 13:051,27212,258,5223,182,0000524,288
5Sep 26, 2026 13:051,27512,274,3983,188,0000524,288
6Sep 26, 2026 13:051,27611,487,1293,190,0000524,288
7Sep 26, 2026 13:051,28211,527,0543,207,0000524,288
8Sep 26, 2026 13:051,28611,616,4803,216,0000524,288
9Sep 26, 2026 13:051,29311,558,7713,234,0000524,288