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 26, 2026 20:00A_ShamanA_ShamanScore: 16,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 20:0016,13649,531,84936,085,0004,256,0002,113,536
2Jun 26, 2026 20:0016,14749,635,63435,910,0004,459,0002,113,536
3Jun 26, 2026 20:0016,16549,710,34435,951,0004,463,0002,113,536
4Jun 26, 2026 20:0016,19749,719,75836,092,0004,402,0002,113,536
5Jun 26, 2026 20:0016,20049,612,06236,123,0004,379,0002,113,536
6Jun 26, 2026 20:0016,25849,772,03636,232,0004,414,0002,113,536
7Jun 26, 2026 20:0016,30649,934,47136,457,0004,308,0002,113,536
8Jun 26, 2026 20:0016,36050,048,07036,727,0004,174,0002,113,536
9Jun 26, 2026 20:0016,56650,590,32937,052,0004,365,0002,113,536