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 listJun 9, 2026 23:23Victor MerckléVictor MerckléScore: 3,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:273,57617,779,7396,463,0002,478,0002,138,112
2Jun 9, 2026 23:273,58517,903,5826,485,0002,479,0002,138,112
3Jun 9, 2026 23:273,60217,970,0616,508,0002,497,0002,138,112
4Jun 9, 2026 23:273,62418,016,3625,436,0003,626,0002,187,264
5Jun 9, 2026 23:273,63418,047,5506,566,0002,520,0002,138,112
6Jun 9, 2026 23:273,66218,010,8335,681,0003,476,0002,129,920
7Jun 9, 2026 23:273,66818,057,8965,549,0003,622,0002,183,168
8Jun 9, 2026 23:273,67218,091,2035,548,0003,634,0002,187,264
9Jun 9, 2026 23:273,74518,269,5445,863,0003,501,0002,129,920