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 listAug 23, 2026 02:59Andrew EpsteinAndrew EpsteinScore: 3,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 02:593,23617,863,4247,029,0001,062,0002,117,632
2Aug 23, 2026 02:593,30617,936,7167,188,0001,077,0002,117,632
3Aug 23, 2026 02:593,30717,986,9507,204,0001,065,0002,117,632
4Aug 23, 2026 02:593,31417,981,7687,210,0001,076,0002,117,632
5Aug 23, 2026 02:593,31817,924,8267,223,0001,073,0002,117,632
6Aug 23, 2026 02:593,34418,087,7617,190,0001,170,0002,117,632
7Aug 23, 2026 02:593,35118,354,9717,210,0001,169,0002,117,632
8Aug 23, 2026 02:593,35319,359,4947,217,0001,166,0002,117,632
9Aug 23, 2026 02:593,35418,003,8787,202,0001,184,0002,117,632