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 05:18Josu San MartinJosu San MartinScore: 5,370Success
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 05:185,33626,110,54511,289,0002,052,0002,527,232
2Feb 5, 2026 05:185,35532,549,84810,298,0003,089,0002,396,160
3Feb 5, 2026 05:185,35928,871,71210,306,0003,091,0002,301,952
4Feb 5, 2026 05:185,36430,295,41010,316,0003,094,0002,527,232
5Feb 5, 2026 05:185,37027,167,74610,328,0003,098,0002,400,256
6Feb 5, 2026 05:185,37032,078,2389,295,0004,131,0002,404,352
7Feb 5, 2026 05:185,38229,399,5689,316,0004,140,0002,482,176
8Feb 5, 2026 05:185,39931,797,46710,383,0003,115,0002,527,232
9Feb 5, 2026 05:185,41732,833,9019,375,0004,167,0002,281,472