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 22, 2026 14:57Dominique GarmierDominique GarmierScore: 33,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 14:5833,890106,451,04282,708,0002,017,0002,359,296
2Apr 22, 2026 14:5833,892102,730,76683,722,0001,008,0002,338,816
3Apr 22, 2026 14:5833,916102,156,31282,796,0001,995,0002,428,928
4Apr 22, 2026 14:5833,91698,038,01982,795,0001,995,0002,342,912
5Apr 22, 2026 14:5833,921102,784,24482,808,0001,995,0002,347,008
6Apr 22, 2026 14:5833,933100,375,02081,839,0002,994,0002,404,352
7Apr 22, 2026 14:5833,95099,692,55980,883,0003,994,0002,342,912
8Apr 22, 2026 14:5833,972104,123,39281,934,0002,997,0002,347,008
9Apr 22, 2026 14:5834,061100,905,10182,149,0003,005,0002,355,200