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 20, 2026 13:19Dominique GarmierDominique GarmierScore: 82,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 13:2182,423230,655,746202,057,0004,001,0002,351,104
2Apr 20, 2026 13:2182,574222,587,115202,427,0004,008,0002,408,448
3Apr 20, 2026 13:2182,615224,466,578204,533,0002,005,0002,379,776
4Apr 20, 2026 13:2182,667222,751,036202,676,0003,993,0002,334,720
5Apr 20, 2026 13:2182,750221,750,578201,880,0004,997,0002,494,464
6Apr 20, 2026 13:2182,771221,711,286203,931,0002,998,0002,392,064
7Apr 20, 2026 13:2182,845222,762,533203,111,0004,002,0002,351,104
8Apr 20, 2026 13:2182,888224,781,589205,219,0002,002,0002,387,968
9Apr 20, 2026 13:2182,930222,780,114205,324,0002,003,0002,408,448