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 30, 2026 00:44Dominique GarmierDominique GarmierScore: 9,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 00:449,43851,456,03919,493,0004,103,0002,355,200
2Mar 30, 2026 00:449,44053,278,44118,469,0005,130,0002,363,392
3Mar 30, 2026 00:449,50150,106,91418,589,0005,163,0002,289,664