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 08:51Charles CabergsCharles CabergsScore: 11,205Success
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 08:5111,05953,026,40222,529,0005,120,0002,461,696
2Apr 21, 2026 08:5111,06455,706,89021,514,0006,147,0002,461,696
3Apr 21, 2026 08:5111,13955,611,79020,887,0006,962,0002,469,888
4Apr 21, 2026 08:5111,19454,571,19319,991,0007,996,0002,465,792
5Apr 21, 2026 08:5111,20551,425,85319,009,0009,004,0002,461,696
6Apr 21, 2026 08:5111,24253,583,17319,072,0009,034,0002,461,696
7Apr 21, 2026 08:5111,30156,482,19221,190,0007,063,0002,465,792
8Apr 21, 2026 08:5111,30453,582,84921,197,0007,065,0002,461,696
9Apr 21, 2026 08:5111,34153,569,01323,290,0005,063,0002,457,600