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 7, 2026 12:01Victor MerckléVictor MerckléScore: 1,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 12:031,74212,033,3633,138,0001,219,0002,113,536
2Jun 7, 2026 12:031,75312,054,1783,140,0001,243,0002,113,536
3Jun 7, 2026 12:031,76212,107,8203,171,0001,234,0002,113,536
4Jun 7, 2026 12:031,80012,250,3393,290,0001,211,0002,113,536
5Jun 7, 2026 12:031,84612,346,6143,402,0001,215,0002,113,536
6Jun 7, 2026 12:031,86612,348,9053,430,0001,235,0002,113,536
7Jun 7, 2026 12:031,88012,799,6143,463,0001,237,0002,113,536
8Jun 7, 2026 12:031,89512,363,9633,498,0001,241,0002,113,536
9Jun 7, 2026 12:031,91514,408,5733,581,0001,208,0002,113,536