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 21, 2026 17:22Charles CabergsCharles CabergsScore: 10,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 17:2210,01844,791,67818,033,0007,013,0002,342,912
2Apr 21, 2026 17:2210,03738,434,54618,067,0007,026,0002,330,624
3Apr 21, 2026 17:2210,04248,349,17619,080,0006,025,0002,338,816
4Apr 21, 2026 17:2210,23643,827,91720,473,0005,118,0002,322,432
5Apr 21, 2026 17:2210,26544,618,40919,504,0006,159,0002,342,912
6Apr 21, 2026 17:2210,33641,689,73119,877,0005,963,0002,338,816
7Apr 21, 2026 17:2210,40147,052,24520,003,0006,000,0002,330,624
8Apr 21, 2026 17:2210,61343,608,96420,411,0006,123,0002,330,624
9Apr 21, 2026 17:2210,71743,588,05818,549,0008,244,0002,334,720