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 27, 2026 00:38Charles CabergsCharles CabergsScore: 7,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 00:397,05035,732,73711,406,0006,221,0002,519,040
2Apr 27, 2026 00:397,08036,929,24413,537,0004,165,0002,371,584
3Apr 27, 2026 00:397,09135,786,91210,429,0007,300,0002,531,328
4Apr 27, 2026 00:397,09435,245,64711,477,0006,260,0002,531,328
5Apr 27, 2026 00:397,09436,479,44512,520,0005,216,0002,531,328
6Apr 27, 2026 00:397,09836,917,98111,831,0005,915,0002,535,424
7Apr 27, 2026 00:397,12034,910,51311,867,0005,933,0002,531,328
8Apr 27, 2026 00:397,14537,225,19611,909,0005,954,0002,527,232
9Apr 27, 2026 00:397,16133,087,94311,936,0005,968,0002,465,792