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 listJul 30, 2026 21:30Andrew TsibinAndrew TsibinScore: 2,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 21:302,11215,375,5173,878,0001,403,0002,117,632
2Jul 30, 2026 21:302,11315,195,2483,879,0001,404,0002,117,632
3Jul 30, 2026 21:302,15916,498,3793,932,0001,466,0002,117,632
4Jul 30, 2026 21:302,16715,391,6713,960,0001,458,0002,117,632
5Jul 30, 2026 21:302,17615,951,7363,987,0001,453,0002,117,632
6Jul 30, 2026 21:302,18015,425,6153,984,0001,467,0002,117,632
7Jul 30, 2026 21:302,18215,488,4803,979,0001,476,0002,117,632
8Jul 30, 2026 21:302,19315,433,4954,009,0001,475,0002,117,632
9Jul 30, 2026 21:302,19916,859,0374,011,0001,487,0002,117,632