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 04:09Victor MerckléVictor MerckléScore: 2,310Success
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 04:112,23013,260,2944,339,0001,236,0002,113,536
2Jun 2, 2026 04:112,27813,324,5444,463,0001,234,0002,113,536
3Jun 2, 2026 04:112,29113,423,7854,492,0001,236,0002,113,536
4Jun 2, 2026 04:112,29413,724,5914,503,0001,234,0002,113,536
5Jun 2, 2026 04:112,31013,408,1074,535,0001,240,0002,113,536
6Jun 2, 2026 04:112,34415,418,5494,600,0001,260,0002,113,536
7Jun 2, 2026 04:112,35013,515,9174,608,0001,269,0002,113,536
8Jun 2, 2026 04:112,35613,521,3174,621,0001,269,0002,113,536
9Jun 2, 2026 04:112,35913,564,8324,633,0001,266,0002,113,536