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 listDec 29, 2025 14:28Aman | अमनAman | अमनScore: 53,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:2853,281471,739,047441,230,0001,000,0002,260,992
2Dec 29, 2025 14:2853,300469,301,112441,388,0001,000,0002,392,064
3Dec 29, 2025 14:2853,315467,647,333441,515,000998,0002,519,040
4Dec 29, 2025 14:2853,333471,008,473440,669,0001,998,0002,519,040
5Dec 29, 2025 14:2853,334471,245,846441,673,000999,0002,375,680
6Dec 29, 2025 14:2853,336464,879,846440,689,0001,998,0002,260,992
7Dec 29, 2025 14:2853,352467,165,473440,826,0001,999,0002,519,040
8Dec 29, 2025 14:2853,379470,582,356441,043,0002,000,0002,519,040
9Dec 29, 2025 14:2853,382469,266,429442,073,0001,000,0002,260,992