Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 3, 2026 18:20Andrew AshworthAndrew AshworthScore: 39,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 18:2139,726339,546,350271,815,00057,916,0002,113,536
2Sep 3, 2026 18:2139,743339,673,135271,696,00058,175,0002,113,536
3Sep 3, 2026 18:2139,749340,438,690271,823,00058,096,0002,113,536
4Sep 3, 2026 18:2139,758339,879,771271,630,00058,368,0002,113,536
5Sep 3, 2026 18:2139,766339,961,651271,731,00058,335,0002,113,536
6Sep 3, 2026 18:2139,774341,417,140271,857,00058,268,0002,113,536
7Sep 3, 2026 18:2139,788339,989,054271,759,00058,489,0002,113,536
8Sep 3, 2026 18:2139,790340,097,316271,601,00058,659,0002,113,536
9Sep 3, 2026 18:2139,802340,298,855272,070,00058,293,0002,113,536