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 19, 2026 09:09olliecrowolliecrowScore: 4,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 09:094,95529,801,59010,324,0002,064,0002,306,048
2Apr 19, 2026 09:094,97929,878,9648,299,0004,149,0002,314,240
3Apr 19, 2026 09:095,10038,543,6159,562,0003,187,0002,314,240