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 listSep 2, 2026 18:29CheckHarryCheckHarryScore: 5,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:295,84658,419,69847,347,0001,179,0002,113,536
2Sep 2, 2026 18:295,86358,585,81447,491,0001,173,0002,113,536
3Sep 2, 2026 18:295,86858,618,37447,663,0001,045,0002,113,536
4Sep 2, 2026 18:295,87358,534,25547,711,0001,037,0002,113,536
5Sep 2, 2026 18:295,87358,612,04647,573,0001,175,0002,113,536
6Sep 2, 2026 18:295,87658,599,53147,728,0001,047,0002,113,536
7Sep 2, 2026 18:295,88258,901,48847,647,0001,175,0002,113,536
8Sep 2, 2026 18:295,88258,667,06747,777,0001,044,0002,113,536
9Sep 2, 2026 18:295,88558,809,56747,804,0001,043,0002,113,536