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 listFeb 6, 2026 05:19Josu San MartinJosu San MartinScore: 3,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 05:193,09425,644,7416,630,0001,105,0002,420,736
2Feb 6, 2026 05:193,11826,492,5446,683,0001,113,0002,379,776
3Feb 6, 2026 05:193,16324,081,3684,942,0002,965,0002,301,952
4Feb 6, 2026 05:193,16622,445,0697,916,00002,420,736
5Feb 6, 2026 05:193,18223,032,5344,972,0002,983,0002,437,120
6Feb 6, 2026 05:193,31423,126,2926,213,0002,071,0002,416,640