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 4, 2026 23:03olliecrowolliecrowScore: 3,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:073,71427,833,4098,003,0001,283,0002,396,160
2May 4, 2026 23:073,74424,659,8328,074,0001,287,0002,400,256
3May 4, 2026 23:073,74525,935,5688,099,0001,265,0002,392,064
4May 4, 2026 23:073,79026,841,6818,208,0001,269,0002,392,064
5May 4, 2026 23:073,83024,869,5418,285,0001,291,0002,400,256
6May 4, 2026 23:073,83628,652,0918,301,0001,289,0002,412,544
7May 4, 2026 23:073,88223,965,5537,384,0002,322,0002,404,352
8May 4, 2026 23:073,91826,308,0547,531,0002,265,0002,392,064
9May 4, 2026 23:074,16028,694,1737,798,0002,604,0002,404,352