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 listMar 14, 2026 15:59Dominique GarmierDominique GarmierScore: 488,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 15:59488,3741,250,570,3801,219,937,000999,0002,318,336
2Mar 14, 2026 15:59488,3851,250,112,3961,217,965,0002,997,0002,289,664
3Mar 14, 2026 15:59488,5831,242,303,0941,219,458,0001,999,0002,310,144