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 listJan 1, 2026 21:30Josu San MartinJosu San MartinScore: 13,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:3013,16257,156,12529,915,0002,991,0002,310,144
2Jan 1, 2026 21:3013,17863,936,48028,952,0003,993,0002,396,160
3Jan 1, 2026 21:3013,30558,545,31128,223,0005,039,0002,322,432