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 4, 2026 17:55Elijah KinElijah KinScore: 4,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 17:554,32219,963,1717,595,0003,211,0002,117,632
2Jun 4, 2026 17:554,37621,647,4667,718,0003,224,0002,117,632
3Jun 4, 2026 17:554,38421,769,8657,774,0003,186,0002,117,632
4Jun 4, 2026 17:554,39320,056,3627,774,0003,210,0002,117,632
5Jun 4, 2026 17:554,39420,030,1397,764,0003,221,0002,117,632
6Jun 4, 2026 17:554,40421,841,0757,784,0003,226,0002,117,632
7Jun 4, 2026 17:554,40720,069,0547,782,0003,237,0002,117,632
8Jun 4, 2026 17:554,45020,244,6227,878,0003,249,0002,117,632
9Jun 4, 2026 17:554,47620,327,1217,935,0003,256,0002,117,632