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:21Aman | अमनAman | अमनScore: 53,330Success
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:2153,264470,073,655441,091,0001,000,0002,379,776
2Dec 29, 2025 14:2153,295466,743,216442,352,00002,379,776
3Dec 29, 2025 14:2153,307471,877,557441,451,0001,001,0002,523,136
4Dec 29, 2025 14:2153,328471,155,192440,623,0001,998,0002,383,872
5Dec 29, 2025 14:2153,330470,559,869441,638,000999,0002,519,040
6Dec 29, 2025 14:2153,335470,790,606440,682,0001,998,0002,260,992
7Dec 29, 2025 14:2153,337474,289,985440,702,0001,998,0002,519,040
8Dec 29, 2025 14:2153,339467,767,998440,712,0001,998,0002,383,872
9Dec 29, 2025 14:2153,356474,770,594441,856,000999,0002,260,992