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 1, 2026 09:57Victor MerckléVictor MerckléScore: 2,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 09:592,49813,756,8384,922,0001,323,0002,113,536
2Jun 1, 2026 09:592,50713,898,7154,941,0001,327,0002,113,536
3Jun 1, 2026 09:592,51213,833,3314,958,0001,324,0002,113,536
4Jun 1, 2026 09:592,51913,820,0014,965,0001,333,0002,113,536
5Jun 1, 2026 09:592,52313,860,5234,982,0001,327,0002,113,536
6Jun 1, 2026 09:592,53913,965,2945,025,0001,323,0002,113,536
7Jun 1, 2026 09:592,60114,013,1315,181,0001,323,0002,113,536
8Jun 1, 2026 09:592,61414,081,8795,214,0001,322,0002,113,536
9Jun 1, 2026 09:592,62214,134,8925,215,0001,342,0002,113,536