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 16:08wnwnScore: 3,447Success
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 16:093,39345,172,64027,162,0001,006,0002,490,368
2Apr 26, 2026 16:093,41346,499,04627,323,0001,011,0002,498,560
3Apr 26, 2026 16:093,42443,011,93227,408,0001,015,0002,330,624
4Apr 26, 2026 16:093,44642,608,08227,589,0001,021,0002,490,368
5Apr 26, 2026 16:093,44741,597,26927,590,0001,021,0002,490,368
6Apr 26, 2026 16:093,46045,895,73926,739,0001,980,0002,486,272
7Apr 26, 2026 16:093,57239,986,75928,631,0001,022,0002,334,720
8Apr 26, 2026 16:093,58748,784,41927,792,0001,985,0002,494,464
9Apr 26, 2026 16:093,60943,653,17528,923,0001,032,0002,490,368