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 2, 2026 13:25Victor MerckléVictor MerckléScore: 2,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 13:262,15513,043,3284,145,0001,244,0002,113,536
2Jun 2, 2026 13:262,15613,076,3014,146,0001,244,0002,113,536
3Jun 2, 2026 13:262,17013,079,9054,170,0001,257,0002,113,536
4Jun 2, 2026 13:262,23113,230,0184,331,0001,247,0002,113,536
5Jun 2, 2026 13:262,23613,241,3944,341,0001,250,0002,113,536
6Jun 2, 2026 13:262,23713,106,9134,343,0001,251,0002,113,536
7Jun 2, 2026 13:262,24213,550,9364,362,0001,245,0002,113,536
8Jun 2, 2026 13:262,25413,623,4084,388,0001,249,0002,113,536
9Jun 2, 2026 13:262,27313,636,1244,414,0001,270,0002,113,536