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 13, 2026 08:05limanjun99limanjun99Score: 3,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:053,88226,449,4877,549,0002,156,0002,510,848
2Apr 13, 2026 08:053,89930,478,1567,581,0002,166,0002,293,760
3Apr 13, 2026 08:053,90029,844,8298,666,0001,083,0002,285,568
4Apr 13, 2026 08:053,90627,082,6727,596,0002,170,0002,510,848
5Apr 13, 2026 08:053,90929,630,0078,687,0001,085,0002,510,848
6Apr 13, 2026 08:053,96135,427,9007,923,0001,980,0002,416,640
7Apr 13, 2026 08:053,96830,405,3145,952,0003,968,0002,285,568
8Apr 13, 2026 08:053,96924,265,0005,954,0003,969,0002,473,984
9Apr 13, 2026 08:054,00227,828,3856,003,0004,002,0002,289,664