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 28, 2025 18:18dhairyadhairyaScore: 1,845,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2025 18:011,844,84215,343,735,39615,122,284,000189,903,0002,416,640
2Feb 28, 2025 18:181,845,43315,346,648,62515,122,191,000194,899,0002,408,448
3Feb 28, 2025 18:011,845,60815,351,376,51715,108,666,000209,884,0002,428,928
4Feb 28, 2025 18:181,845,83515,360,813,30215,140,533,000179,899,0002,457,600
5Feb 28, 2025 18:181,846,55415,359,989,30115,119,519,000206,883,0002,502,656
6Feb 28, 2025 18:011,848,33215,371,960,40715,169,242,000171,912,0002,367,488