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 20, 2024 06:08Javid izadiJavid izadiScore: 128,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2024 06:08128,0921,090,691,2051,061,168,0001,998,0002,285,568
2Dec 20, 2024 06:08128,3331,093,578,9441,063,165,0001,998,0002,285,568
3Dec 20, 2024 06:08128,4201,092,931,1231,065,890,00002,285,568
4Dec 20, 2024 06:08128,5141,091,746,2551,065,665,000999,0002,285,568
5Dec 20, 2024 06:08128,5181,089,976,2371,065,701,000999,0002,285,568
6Dec 20, 2024 06:08128,5771,098,175,9911,065,189,0001,998,0002,285,568
7Dec 20, 2024 06:08128,6441,093,006,9391,067,747,00002,363,392
8Dec 20, 2024 06:08128,7131,094,633,6151,067,319,000999,0002,478,080
9Dec 20, 2024 06:08128,7751,091,171,2851,068,833,00002,281,472