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 6, 2026 12:05Kevin HeaveyKevin HeaveyScore: 3,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:073,55139,297,02028,384,0001,091,0002,113,536
2Sep 6, 2026 12:073,56439,488,04828,495,0001,091,0002,113,536
3Sep 6, 2026 12:073,56839,387,23328,566,0001,050,0002,113,536
4Sep 6, 2026 12:073,57839,550,47828,457,0001,247,0002,113,536
5Sep 6, 2026 12:073,58839,621,13528,683,0001,102,0002,113,536
6Sep 6, 2026 12:073,66040,286,39329,275,0001,104,0002,113,536
7Sep 6, 2026 12:073,69640,567,88329,514,0001,166,0002,113,536
8Sep 6, 2026 12:073,71740,739,09029,756,0001,101,0002,113,536
9Sep 6, 2026 12:073,73440,853,11829,845,0001,149,0002,113,536