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 listMay 1, 2026 04:12olliecrowolliecrowScore: 3,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 04:143,70026,210,1977,196,0002,056,0002,355,200
2May 1, 2026 04:143,70925,798,2807,213,0002,061,0002,383,872
3May 1, 2026 04:143,71128,662,8696,186,0003,093,0002,342,912
4May 1, 2026 04:143,72226,847,2097,239,0002,068,0002,396,160
5May 1, 2026 04:143,73626,112,1307,265,0002,075,0002,404,352
6May 1, 2026 04:143,74626,916,0326,244,0003,122,0002,387,968
7May 1, 2026 04:143,75424,061,3744,171,0005,214,0002,408,448
8May 1, 2026 04:144,04228,463,7116,063,0004,042,0002,400,256
9May 1, 2026 04:144,17030,260,7517,299,0003,128,0002,396,160