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:20A_ShamanA_ShamanScore: 27,582Success
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:2127,21277,188,30060,714,0007,316,0002,113,536
2Jun 21, 2026 17:2127,22277,303,31560,779,0007,276,0002,113,536
3Jun 21, 2026 17:2127,47977,872,87661,523,0007,176,0002,113,536
4Jun 21, 2026 17:2127,58079,353,19261,331,0007,620,0002,113,536
5Jun 21, 2026 17:2127,58278,100,09761,885,0007,071,0002,113,536
6Jun 21, 2026 17:2127,59578,134,63562,099,0006,889,0002,113,536
7Jun 21, 2026 17:2127,97979,338,46962,486,0007,463,0002,113,536
8Jun 21, 2026 17:2128,27379,865,01063,238,0007,445,0002,113,536
9Jun 21, 2026 17:2128,39580,223,78763,827,0007,161,0002,113,536