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 listJun 21, 2026 17:40A_ShamanA_ShamanScore: 16,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:4016,30849,951,22337,385,0003,387,0002,113,536
2Jun 21, 2026 17:4016,37850,039,01437,581,0003,366,0002,113,536
3Jun 21, 2026 17:4016,44650,263,24336,986,0004,131,0002,113,536
4Jun 21, 2026 17:4016,45050,253,10636,843,0004,283,0002,113,536
5Jun 21, 2026 17:4016,46850,430,72036,641,0004,530,0002,113,536
6Jun 21, 2026 17:4016,47250,328,87137,008,0004,173,0002,113,536
7Jun 21, 2026 17:4016,60750,710,89438,104,0003,414,0002,113,536
8Jun 21, 2026 17:4016,62650,702,69638,224,0003,342,0002,113,536
9Jun 21, 2026 17:4016,71051,047,24238,279,0003,498,0002,113,536