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 listApr 26, 2026 13:33wnwnScore: 3,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:343,41545,189,64627,338,0001,012,0002,330,624
2Apr 26, 2026 13:343,43345,642,64327,477,0001,017,0002,490,368
3Apr 26, 2026 13:343,44641,446,56727,581,0001,021,0002,486,272
4Apr 26, 2026 13:343,45043,718,14327,620,0001,022,0002,330,624
5Apr 26, 2026 13:343,45048,074,17627,616,0001,022,0002,486,272
6Apr 26, 2026 13:343,47349,266,72926,846,0001,988,0002,478,080
7Apr 26, 2026 13:343,55151,613,90628,459,0001,016,0002,482,176
8Apr 26, 2026 13:343,64045,871,41529,211,0001,007,0002,482,176
9Apr 26, 2026 13:343,64147,285,74529,214,0001,007,0002,482,176