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 20, 2026 17:02A_ShamanA_ShamanScore: 23,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 17:0223,39267,709,43453,353,0005,128,0002,117,632
2Jun 20, 2026 17:0223,63568,671,50753,721,0005,367,0002,117,632
3Jun 20, 2026 17:0223,93269,172,58654,403,0005,427,0002,117,632