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 listJul 15, 2022 16:55Yuriy LyfenkoYuriy LyfenkoScore: 11,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 16:5511,770373,236,91295,699,0001,993,0002,277,376
2Jul 15, 2022 16:5511,772372,228,13895,714,0001,994,0002,285,568
3Jul 15, 2022 16:5511,775375,477,26196,723,0001,007,0002,277,376
4Jul 15, 2022 16:5511,783374,538,31195,802,0001,995,0002,277,376
5Jul 15, 2022 16:5511,786371,645,21395,829,0001,996,0002,273,280
6Jul 15, 2022 16:5511,786369,336,35495,830,0001,996,0002,277,376
7Jul 15, 2022 16:5511,788375,771,46295,847,0001,996,0002,285,568
8Jul 15, 2022 16:5511,793371,890,51395,881,0001,997,0002,281,472
9Jul 15, 2022 16:5511,795372,034,92895,899,0001,997,0002,277,376
10Jul 15, 2022 16:5511,931412,163,76699,024,30302,277,376
11Jul 15, 2022 16:5511,941410,963,96299,109,13002,260,992
12Jul 15, 2022 16:5511,944408,082,22999,138,20802,252,800