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 05:41olliecrowolliecrowScore: 3,719Success
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 05:443,70223,417,3077,200,0002,057,0002,400,256
2Apr 27, 2026 05:443,71226,767,5327,219,0002,062,0002,387,968
3Apr 27, 2026 05:443,71326,799,3287,221,0002,063,0002,392,064
4Apr 27, 2026 05:443,71427,493,7076,190,0003,095,0002,392,064
5Apr 27, 2026 05:443,71925,729,4037,233,0002,066,0002,486,272
6Apr 27, 2026 05:443,77429,730,0197,340,0002,097,0002,396,160
7Apr 27, 2026 05:443,80728,749,1127,403,0002,115,0002,392,064
8Apr 27, 2026 05:443,91328,410,8377,610,0002,174,0002,400,256
9Apr 27, 2026 05:443,96226,139,6995,943,0003,962,0002,404,352