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 17, 2026 23:33olliecrowolliecrowScore: 4,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 19:044,36829,317,4569,929,000992,0002,416,640
2Apr 17, 2026 19:044,38031,171,3078,960,0001,991,0002,494,464
3Apr 17, 2026 19:044,56230,425,05010,368,0001,036,0002,342,912
4Apr 17, 2026 23:334,58029,454,1199,368,0002,081,0002,416,640
5Apr 17, 2026 19:044,58127,468,6748,329,0003,123,0002,396,160
6Apr 17, 2026 19:044,59429,561,7608,352,0003,132,0002,404,352
7Apr 17, 2026 23:334,60832,485,6079,425,0002,094,0002,297,856
8Apr 17, 2026 23:334,63628,197,6928,429,0003,161,0002,301,952
9Apr 17, 2026 19:044,64029,029,7519,492,0002,109,0002,269,184
10Apr 17, 2026 19:044,64531,338,2399,501,0002,111,0002,408,448
11Apr 17, 2026 19:044,75929,669,03010,907,000991,0002,408,448
12Apr 17, 2026 19:044,82832,761,97010,059,0002,011,0002,408,448