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 21, 2026 17:32A_ShamanA_ShamanScore: 19,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:3219,15058,318,67142,586,0005,290,0002,113,536
2Jun 21, 2026 17:3219,16857,098,86842,345,0005,575,0002,113,536
3Jun 21, 2026 17:3219,18757,044,74143,547,0004,421,0002,113,536
4Jun 21, 2026 17:3219,21157,211,50442,429,0005,600,0002,113,536
5Jun 21, 2026 17:3219,24757,218,34642,657,0005,462,0002,113,536
6Jun 21, 2026 17:3219,30257,440,82942,524,0005,731,0002,113,536
7Jun 21, 2026 17:3219,30557,443,54942,539,0005,724,0002,113,536
8Jun 21, 2026 17:3219,36657,543,53442,818,0005,598,0002,113,536
9Jun 21, 2026 17:3219,62258,109,46843,481,0005,575,0002,113,536