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 30, 2026 09:34Charles CabergsCharles CabergsScore: 5,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 09:355,54632,031,40110,896,0002,971,0002,330,624
2Apr 30, 2026 09:355,56031,865,8519,930,0003,972,0002,338,816
3Apr 30, 2026 09:355,70730,224,5818,154,0006,115,0002,326,528
4Apr 30, 2026 09:355,71628,349,58310,208,0004,083,0002,322,432
5Apr 30, 2026 09:355,72228,805,3119,197,0005,109,0002,392,064
6Apr 30, 2026 09:355,72933,820,57110,231,0004,092,0002,326,528
7Apr 30, 2026 09:355,73033,841,57810,233,0004,093,0002,318,336
8Apr 30, 2026 09:355,76333,300,7888,233,0006,175,0002,400,256
9Apr 30, 2026 09:355,80931,999,7819,337,0005,187,0002,326,528