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:14Javid izadiJavid izadiScore: 124,616Success
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:14124,3751,061,319,0481,031,317,000999,0002,367,488
2Dec 20, 2024 06:14124,3831,060,245,5271,031,378,000999,0002,371,584
3Dec 20, 2024 06:14124,4251,054,678,7421,031,729,000999,0002,285,568
4Dec 20, 2024 06:14124,4891,057,947,2351,031,259,0001,998,0002,367,488
5Dec 20, 2024 06:14124,6161,060,680,4431,033,310,000999,0002,367,488
6Dec 20, 2024 06:14124,6271,063,298,1061,033,408,000999,0002,363,392
7Dec 20, 2024 06:14124,6961,066,268,2041,033,976,000999,0002,285,568
8Dec 20, 2024 06:14124,7121,065,007,8791,034,108,000999,0002,371,584
9Dec 20, 2024 06:14124,7601,065,897,1321,033,506,0001,999,0002,371,584