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 listFeb 5, 2026 03:43Josu San MartinJosu San MartinScore: 7,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 03:437,06944,055,99714,554,0003,118,0002,498,560
2Feb 5, 2026 03:437,09947,736,92312,528,0005,220,0002,273,280
3Feb 5, 2026 03:437,15848,680,18414,912,0002,982,0002,490,368
4Feb 5, 2026 03:437,16247,477,48214,920,0002,984,0002,498,560
5Feb 5, 2026 03:437,17643,961,39514,950,0002,990,0002,498,560
6Feb 5, 2026 03:437,18045,415,84112,965,0004,986,0002,347,008
7Feb 5, 2026 03:437,19642,365,14315,992,0001,999,0002,269,184
8Feb 5, 2026 03:437,32550,260,10713,226,0005,087,0002,502,656
9Feb 5, 2026 03:437,37444,860,75515,364,0003,072,0002,285,568