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 27, 2026 05:02Victor MerckléVictor MerckléScore: 2,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 05:032,64814,199,4244,188,0002,432,0002,142,208
2Jun 27, 2026 05:032,67414,384,7804,466,0002,220,0002,142,208
3Jun 27, 2026 05:032,69315,939,8854,214,0002,519,0002,142,208
4Jun 27, 2026 05:032,73515,844,6444,207,0002,632,0002,142,208
5Jun 27, 2026 05:032,75516,689,6744,408,0002,480,0002,142,208
6Jun 27, 2026 05:032,84716,494,2274,776,0002,343,0002,142,208
7Jun 27, 2026 05:032,87116,064,2764,661,0002,518,0002,142,208
8Jun 27, 2026 05:032,87916,458,1924,712,0002,486,0002,142,208
9Jun 27, 2026 05:032,90615,177,1304,886,0002,380,0002,142,208