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 05:31Josu San MartinJosu San MartinScore: 30,769Success
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 05:2330,727278,260,676253,033,0002,000,0002,494,464
2Dec 29, 2025 05:3230,728285,535,925253,043,0002,000,0002,367,488
3Dec 30, 2025 04:5030,733275,664,487253,082,0002,000,0002,277,376
4Dec 30, 2025 04:5030,733278,557,379252,085,0003,001,0002,359,296
5Dec 29, 2025 05:2330,737276,020,070253,120,0002,000,0002,277,376
6Dec 29, 2025 05:3730,741278,744,974252,151,0003,001,0002,277,376
7Dec 29, 2025 05:2330,753282,760,714254,251,0001,000,0002,363,392
8Dec 29, 2025 05:2330,760279,394,163254,304,0001,001,0002,363,392
9Dec 29, 2025 05:2330,763278,966,329253,330,0002,002,0002,363,392
10Dec 29, 2025 05:2330,763282,910,404254,328,0001,001,0002,289,664
11Dec 29, 2025 05:3230,769277,544,338255,380,00002,355,200
12Dec 29, 2025 05:3130,770277,687,515254,389,0001,001,0002,367,488
13Dec 29, 2025 05:3730,778281,322,247254,459,0001,001,0002,363,392
14Dec 29, 2025 05:3730,778276,967,508254,456,0001,001,0002,363,392
15Dec 29, 2025 05:2330,785282,230,828254,514,0001,002,0002,285,568
16Dec 29, 2025 05:2330,800280,362,387251,650,0003,994,0002,277,376
17Dec 29, 2025 05:3130,811284,820,325253,732,0001,997,0002,363,392
18Dec 29, 2025 05:2330,811281,360,195252,733,0002,996,0002,277,376
19Dec 29, 2025 05:3130,813288,445,038253,749,0001,998,0002,342,912
20Dec 30, 2025 04:5030,815281,520,456252,771,0002,997,0002,277,376
21Dec 29, 2025 05:3230,838284,693,546253,954,0001,999,0002,506,752