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 listFeb 26, 2026 21:21Daniel MastalerzDaniel MastalerzScore: 5,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 21:215,51976,412,15243,814,0001,991,0002,424,832
2Feb 26, 2026 21:215,52073,415,60043,821,0001,991,0002,265,088
3Feb 26, 2026 21:215,52273,917,18544,833,000996,0002,424,832
4Feb 26, 2026 21:215,52470,614,86343,859,0001,993,0002,293,760
5Feb 26, 2026 21:215,54969,541,80544,053,0002,002,0002,293,760
6Feb 26, 2026 21:215,62474,493,55646,679,00002,424,832
7Feb 26, 2026 21:215,62670,068,60944,663,0002,030,0002,293,760
8Feb 26, 2026 21:215,64174,988,51644,827,0001,992,0002,285,568
9Feb 26, 2026 21:215,64679,307,02444,867,0001,994,0002,404,352
10Feb 26, 2026 21:215,65471,694,67743,936,0002,995,0002,412,544
11Feb 26, 2026 21:215,67872,855,91944,123,0003,008,0002,285,568
12Feb 26, 2026 21:215,73074,048,97345,535,0002,023,0002,277,376