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 listAug 2, 2025 20:32Jack FrigaardJack FrigaardScore: 4,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:324,92067,590,60937,845,0002,987,0002,449,408
2Aug 2, 2025 20:324,92167,389,57638,853,0001,992,0002,445,312
3Aug 2, 2025 20:324,94264,683,73839,020,0002,001,0002,449,408
4Aug 2, 2025 20:324,94266,009,69139,021,0002,001,0002,519,040
5Aug 2, 2025 20:324,95063,899,96439,082,0002,004,0002,519,040
6Aug 2, 2025 20:324,95168,415,74338,085,0003,006,0002,453,504
7Aug 2, 2025 20:324,98568,033,58638,346,0003,027,0002,453,504
8Aug 2, 2025 20:324,99064,827,45338,387,0003,030,0002,519,040
9Aug 2, 2025 20:325,04073,869,58439,839,0001,991,0002,519,040
10Aug 2, 2025 20:325,04066,550,01438,844,0002,988,0002,519,040
11Aug 2, 2025 20:325,04266,279,38741,845,00002,519,040
12Aug 2, 2025 20:325,04371,377,30240,864,000996,0002,449,408