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 listApr 22, 2026 23:23Charles CabergsCharles CabergsScore: 8,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 23:238,33140,625,55812,894,0007,935,0002,334,720
2Apr 22, 2026 23:238,34639,644,08313,911,0006,955,0002,383,872
3Apr 22, 2026 23:238,36535,856,70115,934,0004,979,0002,342,912
4Apr 22, 2026 23:238,38040,975,39614,965,0005,986,0002,342,912
5Apr 22, 2026 23:238,38637,903,53813,977,0006,988,0002,338,816
6Apr 22, 2026 23:238,38742,494,39714,978,0005,991,0002,338,816
7Apr 22, 2026 23:238,43438,030,16317,069,0004,016,0002,334,720
8Apr 22, 2026 23:238,48740,300,74014,146,0007,073,0002,461,696
9Apr 22, 2026 23:238,53138,886,51314,930,0006,398,0002,326,528