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 7, 2026 20:59T PrathamT PrathamScore: 10,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 20:5910,35957,434,68322,910,0002,988,0002,514,944
2Feb 7, 2026 20:5910,45554,255,77323,122,0003,015,0002,306,048
3Feb 7, 2026 20:5910,46355,612,03221,128,0005,030,0002,453,504
4Feb 7, 2026 20:5910,48657,607,19922,182,0004,033,0002,277,376
5Feb 7, 2026 20:5910,52352,421,37823,272,0003,035,0002,306,048
6Feb 7, 2026 20:5910,56351,278,59923,361,0003,047,0002,289,664
7Feb 7, 2026 20:5910,66154,283,85723,577,0003,075,0002,281,472
8Feb 7, 2026 20:5910,75753,096,94223,905,0002,988,0002,310,144
9Feb 7, 2026 20:5910,92554,753,90022,255,0005,058,0002,510,848