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 listMar 30, 2026 07:14Dominique GarmierDominique GarmierScore: 21,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 22:5121,75080,813,15052,363,0002,013,0002,416,640
2Mar 30, 2026 22:5121,75284,443,26448,337,0006,042,0002,396,160
3Mar 30, 2026 06:0821,77779,153,42351,419,0003,024,0002,379,776
4Mar 30, 2026 06:0821,81377,646,31651,503,0003,029,0002,514,944
5Mar 30, 2026 22:5121,89679,168,79452,713,0002,027,0002,371,584
6Mar 30, 2026 07:1421,90283,850,98149,685,0005,069,0002,314,240
7Mar 30, 2026 06:0822,00379,735,35451,008,0004,000,0002,301,952
8Mar 30, 2026 07:1422,02084,065,65552,048,0003,002,0002,396,160
9Mar 30, 2026 07:1422,04089,362,81249,089,0006,010,0002,363,392