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:46Andrew TsibinAndrew TsibinScore: 1,983Success
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:471,96614,965,9813,584,0001,333,0002,117,632
2Jul 30, 2026 21:471,97614,884,9543,611,0001,331,0002,117,632
3Jul 30, 2026 21:471,98214,955,3293,626,0001,329,0002,117,632
4Jul 30, 2026 21:471,98314,997,2933,634,0001,325,0002,117,632
5Jul 30, 2026 21:471,98316,959,5713,641,0001,318,0002,117,632
6Jul 30, 2026 21:471,98314,942,9403,631,0001,328,0002,117,632
7Jul 30, 2026 21:471,98914,928,8963,647,0001,327,0002,117,632
8Jul 30, 2026 21:471,99215,000,3283,655,0001,325,0002,117,632
9Jul 30, 2026 21:472,01115,092,6623,677,0001,352,0002,117,632