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 9, 2026 17:51olliecrowolliecrowScore: 8,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 17:518,16039,633,42019,380,0001,020,0002,482,176
2Apr 9, 2026 17:518,26551,219,03317,563,0003,099,0002,494,464
3Apr 9, 2026 17:518,29249,023,96116,782,0003,948,0002,392,064