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 21:47Charles CabergsCharles CabergsScore: 8,734Success
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 21:478,65737,708,47115,460,0006,184,0002,338,816
2Apr 22, 2026 21:478,68139,381,65815,503,0006,201,0002,334,720
3Apr 22, 2026 21:478,68638,369,57214,477,0007,238,0002,330,624
4Apr 22, 2026 21:478,68638,917,42015,512,0006,204,0002,330,624
5Apr 22, 2026 21:478,73440,305,66415,881,0005,955,0002,334,720
6Apr 22, 2026 21:478,75043,074,65513,921,0007,954,0002,338,816
7Apr 22, 2026 21:478,75441,477,24917,907,0003,979,0002,347,008
8Apr 22, 2026 21:478,76541,038,91315,937,0005,976,0002,338,816
9Apr 22, 2026 21:478,84439,072,83214,070,0008,040,0002,338,816