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 listOct 11, 2025 19:14Serge SmirnovSerge SmirnovScore: 28,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 19:1428,850258,858,055238,458,0001,001,0002,260,992
2Oct 11, 2025 19:1528,850261,614,562238,455,0001,001,0002,269,184
3Oct 11, 2025 19:1528,855272,188,611239,495,00002,285,568
4Oct 11, 2025 19:1428,856265,986,490239,507,00002,265,088
5Oct 11, 2025 19:1528,858266,407,080238,522,0001,002,0002,285,568
6Oct 11, 2025 19:1428,874265,619,273238,660,000998,0002,277,376
7Oct 11, 2025 19:1528,876267,841,853238,673,000998,0002,269,184
8Oct 11, 2025 19:1428,877263,134,622237,686,0001,997,0002,285,568
9Oct 11, 2025 19:1428,880265,741,691237,708,0001,997,0002,510,848
10Oct 11, 2025 19:1528,880270,444,275238,707,000998,0002,285,568
11Oct 11, 2025 19:1528,880272,882,468238,703,000998,0002,367,488
12Oct 11, 2025 19:1428,881267,676,969238,711,000998,0002,351,104