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 18, 2026 20:27Charles CabergsCharles CabergsScore: 13,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 20:2712,91658,562,04026,237,0006,054,0002,428,928
2Apr 18, 2026 20:2712,98564,747,11722,318,00010,144,0002,318,336
3Apr 18, 2026 20:2713,00861,678,40325,407,0007,114,0002,453,504
4Apr 18, 2026 20:2713,11062,927,31920,857,00011,918,0002,494,464
5Apr 18, 2026 20:2713,14857,058,10421,913,00010,956,0002,277,376
6Apr 18, 2026 20:2713,19359,733,49523,987,0008,995,0002,469,888
7Apr 18, 2026 20:2713,22657,817,21523,046,00010,020,0002,457,600
8Apr 18, 2026 20:2713,33957,711,84621,221,00012,126,0002,342,912
9Apr 18, 2026 20:2713,58260,658,14721,970,00011,984,0002,396,160