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 17, 2026 02:15olliecrowolliecrowScore: 5,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 02:155,18834,284,7819,978,0002,993,0002,383,872
2Apr 17, 2026 02:155,27531,606,2129,130,0004,058,0002,383,872
3Apr 17, 2026 02:155,41248,911,7089,367,0004,163,0002,359,296